The spread of unicyclic graphs with given size of maximum matchings
From MaRDI portal
Publication:551847
DOI10.1007/S10910-006-9141-6zbMATH Open1217.05146OpenAlexW2001681519MaRDI QIDQ551847FDOQ551847
Authors: Jianbin Zhang, Bo Zhou, Xueliang 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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42)
Cites Work
- Eigenspaces of graphs
- Spectra of unicyclic graphs
- A table of connected graphs on six vertices
- The spread of a matrix
- Lower bounds for the spread of a matrix
- Bounds on the largest eigenvalues of trees with a given size of matching
- On the spectral radius of unicyclic graphs with perfect matchings
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the spectral radius of trees
- Title not available (Why is that?)
Cited In (12)
- Minimal spread of integral circulant graphs
- The Laplacian spread of unicyclic graphs
- On unicyclic conjugated molecules with minimal energies
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- Maximum spread of \(K_{2,t}\)-minor-free graphs
- On the maximum spread of planar and outerplanar graphs
- Graph Limits and Spectral Extremal Problems for Graphs
- The spread of the unicyclic graphs
- The inertia of unicyclic graphs and the implications for closed-shells
- The Laplacian spread of quasi-tree graphs
- The Laplacian spread of line graphs
- The \(A_\alpha\)-spread of a graph
This page was built for publication: The spread of unicyclic graphs with given size of maximum matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551847)
