Connectivity and eigenvalues of graphs with given girth or clique number

DOI10.1016/j.laa.2020.08.015zbMath1459.05173arXiv2001.00740OpenAlexW3059273804MaRDI QIDQ2226409

Zheng-Jiang Xia, Zhen-Mu Hong, Hong-Jian Lai

Publication date: 12 February 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.00740

zbMATH Keywords

eigenvaluegirthclique numberedge-connectivityalgebraic connectivityvertex-connectivity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40)

Related Items (5)

Interpretable random forest model for identification of edge 3-uncolorable cubic graphs ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs ⋮ Fractional arboricity, strength and eigenvalues of graphs with fixed girth or clique number ⋮ On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Spectra of graphs
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Minimum cuts, girth and a spectral threshold
• Eigenvalues and edge-connectivity of regular graphs
• Interlacing eigenvalues and graphs
• Vertex-connectivity and eigenvalues of graphs with fixed girth
• The second largest eigenvalue and vertex-connectivity of regular multigraphs
• Note on edge-disjoint spanning trees and eigenvalues
• Vertex-connectivity and eigenvalues of graphs
• Spanning tree packing number and eigenvalues of graphs with given girth
• Edge-disjoint spanning trees and eigenvalues of graphs
• Edge-connectivity and (signless) Laplacian eigenvalue of graphs
• Edge-disjoint spanning trees and eigenvalues
• Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
• Partitioning Sparse Matrices with Eigenvectors of 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: Connectivity and eigenvalues of graphs with given girth or clique number