Matching number and characteristic polynomial of a graph
Matching number and the spectral properties depending on the characteristic polynomial of a graph obtained by means of the adjacency polynomial has many interesting applications in different areas of science. There are some work giving the relation of these two areas. Here the relations between thes...
Main Authors: | Aysun Yurttas Gunes, Musa Demirci, Mert Sinan Oz, Ismail Naci Cangul |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2020-01-01
|
Series: | Journal of Taibah University for Science |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/16583655.2020.1796275 |
Similar Items
-
Sum-edge characteristic polynomials of graphs
by: Mert Sinan Oz, et al.
Published: (2019-12-01) -
The extremal graphs with respect to their nullity
by: Sa Rula, et al.
Published: (2016-02-01) -
On the nullity number of graphs
by: Mustapha Aouchiche, et al.
Published: (2017-10-01) -
The largest matching roots of unicyclic graphs with a fixed matching number
by: Hailiang Zhang, et al.
Published: (2017-01-01) -
Fibonacci Graphs
by: Aysun Yurttas Gunes, et al.
Published: (2020-08-01)