The spread of unicyclic graphs with given size of maximum matchings

DOI10.1007/s10910-006-9141-6zbMath1217.05146OpenAlexW2001681519MaRDI QIDQ551847

Bo Zhou, Jianbin Zhang, Xue Liang Li

Publication date: 21 July 2011

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-006-9141-6

zbMATH Keywords

eigenvaluecharacteristic polynomialspreadunicyclic graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)

Related Items (10)

The Laplacian spread of unicyclic graphs ⋮ Minimal spread of integral circulant graphs ⋮ Maximum spread of \(K_{2,t}\)-minor-free graphs ⋮ The \(A_\alpha\)-spread of a graph ⋮ Graph Limits and Spectral Extremal Problems for Graphs ⋮ The Laplacian spread of quasi-tree graphs ⋮ Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread ⋮ The inertia of unicyclic graphs and the implications for closed-shells ⋮ On unicyclic conjugated molecules with minimal energies ⋮ The Laplacian spread of line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A table of connected graphs on six vertices
• Lower bounds for the spread of a matrix
• Spectra of unicyclic graphs
• Bounds on the largest eigenvalues of trees with a given size of matching
• On the spectral radius of unicyclic graphs with perfect matchings
• The spread of a matrix
• On the spectral radius of trees

This page was built for publication: The spread of unicyclic graphs with given size of maximum matchings