Matching number and characteristic polynomial of a graph

Abstract

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 these two notions are considered and several general results giving this relations are obtained. A result given for only unicyclic graphs is generalized. There are some methods for determining the matching number of a graph in literature. Usually nullity, spanning trees and several graph parts are used to do this. Here, as a new method, the conditions for calculating the matching number of a graph by means of the coefficients of the characteristic polynomial of the graph are determined. Finally some results on the matching number of graphs are obtained.

Keywords:

• Matching number
• characteristic polynomial
• nullity

2000 Mathematics Subject Classifications:

• 05C70
• 05C50
• 05C17
• 05C31
• 05C05

Disclosure statement

No potential conflict of interest was reported by the author(s).