Vertex-connectivity and eigenvalues of graphs with fixed girth

DOI10.1016/J.AMC.2018.09.053MaRDI QIDQ2008368zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

connectivitygirthLaplacian eigenvalueadjacency eigenvaluesignless Laplacian eigenvaluequotient matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inequalities involving eigenvalues and eigenvectors (15A42) Connectivity (05C40)

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

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 3046496 (Why is no real title available?)
• Edge-connectivity in regular multigraphs from eigenvalues
• Edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Eigenvalues and edge-connectivity of regular graphs
• Graph theory
• Interlacing eigenvalues and graphs
• Minimum cuts, girth and a spectral threshold
• Note on edge-disjoint spanning trees and eigenvalues
• On graphs with equal algebraic and vertex connectivity
• Spectra of graphs
• Spectral bounds for the connectivity of regular graphs with given order

Cited in

(14)

• Supereulerian regular matroids without small cocircuits
• Sharp spectral bounds for the vertex-connectivity of regular graphs
• Minimum cuts, girth and a spectral threshold
• Connectivity and eigenvalues of graphs with given girth or clique number
• Fractional matching number and spectral radius of nonnegative matrices of graphs
• Vertex-connectivity and eigenvalues of graphs
• Hamiltonian \(s\)-properties and eigenvalues of \(k\)-connected graphs
• Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)
• Spanning tree packing number and eigenvalues of graphs with given girth
• The vertex connectivity and the third largest eigenvalue in regular (multi-)graphs
• Star complements and connectivity in finite 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)