281 research outputs found
On the unimodality of independence polynomials of some graphs
In this paper we study unimodality problems for the independence polynomial
of a graph, including unimodality, log-concavity and reality of zeros. We
establish recurrence relations and give factorizations of independence
polynomials for certain classes of graphs. As applications we settle some
unimodality conjectures and problems.Comment: 17 pages, to appear in European Journal of Combinatoric
Bounds on the eigenvalues of graphs with cut vertices or edges
AbstractIn this paper, we characterize the extremal graph having the maximal Laplacian spectral radius among the connected bipartite graphs with n vertices and k cut vertices, and describe the extremal graph having the minimal least eigenvalue of the adjacency matrices of all the connected graphs with n vertices and k cut edges. We also present lower bounds on the least eigenvalue in terms of the number of cut vertices or cut edges and upper bounds on the Laplacian spectral radius in terms of the number of cut vertices
- …