The inertia of unicyclic graphs and bicyclic graphs

Abstract

Let G be a graph with n vertices and (G) be the matching number of G. The inertia of a graph G, In(G) = (n+;n ;n0) is an integer triple specifying the numbers of positive, negative and zero eigenvalues of the adjacency matrix A(G), respectively. Let (G) = n0 denote the nullity of G (the multiplicity of the eigenvalue zero of G). It is well known that if G is a tree, then (G) = n 2 (G). Guo et al. [Ji-Ming Guo, Weigen Yan and Yeong-Nan Yeh. On the nullity and the matching number of unicyclic graphs, Linear Algebra and its Applications, 431 (2009), 1293{1301.] proved if G is a unicyclic graph, then (G) equals n 2 (G) 1;n 2 (G) or n 2 (G) + 2. Barrett et al. determined the inertia sets for trees and graphs with cut vertices. In this paper, we give the nullity of bicyclic graphs B ++ . Furthermore, we determine the inertia set in unicyclic graphs and B ++ , respectively.