Vertex-connectivity and eigenvalues of graphs with fixed girth
DOI10.1016/J.AMC.2018.09.053zbMath1428.05198OpenAlexW2900003061WikidataQ128998138 ScholiaQ128998138MaRDI QIDQ2008368
Hong-Jian Lai, Yang Wu, Yingzhi Tian, Rui-fang Liu
Publication date: 25 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2018.09.053
connectivitygirthLaplacian eigenvalueadjacency eigenvaluesignless Laplacian eigenvaluequotient matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Spectra of graphs
- Minimum cuts, girth and a spectral threshold
- Eigenvalues and edge-connectivity of regular graphs
- Interlacing eigenvalues and graphs
- Note on edge-disjoint spanning trees and eigenvalues
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-disjoint spanning trees and eigenvalues
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order
- On graphs with equal algebraic and vertex connectivity
- Edge-connectivity in regular multigraphs from eigenvalues
This page was built for publication: Vertex-connectivity and eigenvalues of graphs with fixed girth