Vertex-connectivity and eigenvalues of graphs with fixed girth
From MaRDI portal
Publication:2008368
DOI10.1016/j.amc.2018.09.053zbMath1428.05198MaRDI 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
connectivity; girth; Laplacian eigenvalue; adjacency eigenvalue; signless Laplacian eigenvalue; quotient matrix
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A42: Inequalities involving eigenvalues and eigenvectors
15A18: Eigenvalues, singular values, and eigenvectors
05C40: Connectivity
Related Items
Fractional matching number and spectral radius of nonnegative matrices of graphs, Supereulerian regular matroids without small cocircuits, Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs, Connectivity and eigenvalues of graphs with given girth or clique number, On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\), Vertex-connectivity and eigenvalues of graphs, Sharp spectral bounds for the vertex-connectivity of regular graphs, Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs
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
