Vertex-connectivity and eigenvalues of graphs with fixed girth
DOI10.1016/J.AMC.2018.09.053zbMATH Open1428.05198OpenAlexW2900003061WikidataQ128998138 ScholiaQ128998138MaRDI QIDQ2008368FDOQ2008368
Authors: Hong-Jian Lai, Yingzhi Tian, Yang Wu, 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
Recommendations
- Vertex-connectivity and eigenvalues of graphs
- Connectivity and eigenvalues of graphs with given girth or clique number
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Spanning tree packing number and eigenvalues of graphs with given girth
- Sharp spectral bounds for the vertex-connectivity of regular graphs
connectivitygirthLaplacian eigenvalueadjacency eigenvaluesignless Laplacian eigenvaluequotient matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Connectivity (05C40)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Spectra of graphs
- Interlacing eigenvalues and graphs
- Title not available (Why is that?)
- Edge-disjoint spanning trees and eigenvalues of graphs
- Edge-disjoint spanning trees and eigenvalues
- On graphs with equal algebraic and vertex connectivity
- Note on edge-disjoint spanning trees and eigenvalues
- Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Eigenvalues and edge-connectivity of regular graphs
- Edge-connectivity in regular multigraphs from eigenvalues
- Minimum cuts, girth and a spectral threshold
- Spectral Bounds for the Connectivity of Regular Graphs with Given Order
Cited In (11)
- Vertex-connectivity and eigenvalues of graphs
- Connectivity and eigenvalues of graphs with given girth or clique number
- Fractional matching number and spectral radius of nonnegative matrices of graphs
- Minimum cuts, girth and a spectral threshold
- On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
- The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
- Supereulerian regular matroids without small cocircuits
- Sharp spectral bounds for the vertex-connectivity of regular graphs
- Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
- Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs
- Spectral bounds for the vulnerability parameters of graphs
This page was built for publication: Vertex-connectivity and eigenvalues of graphs with fixed girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2008368)
