Edge-connectivity and (signless) Laplacian eigenvalue of graphs

DOI10.1016/j.laa.2013.10.017zbMath1282.05134OpenAlexW2111516352MaRDI QIDQ2435574

Feng Tian, Mei Lu, Huiqing Liu

Publication date: 19 February 2014

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

Full work available at URL: https://doi.org/10.1016/j.laa.2013.10.017

zbMATH Keywords

girthLaplacian eigenvalueedge-connectivitysignless Laplacian eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (7)

Bounds on the independence number and signless Laplacian index of graphs ⋮ Connectivity and eigenvalues of graphs with given girth or clique number ⋮ Spectral conditions for graphs to be β-deficient involving minimum degree ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Spectral conditions for some graphical properties ⋮ Vertex-connectivity and eigenvalues of graphs ⋮ Spanning tree packing number and eigenvalues of graphs with given girth

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds of Laplacian spectrum of graphs based on the domination number
• Spectra of graphs
• Signless Laplacians of finite graphs
• Unoriented Laplacian maximizing graphs are degree maximal
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Minimum cuts, girth and a spectral threshold
• Eigenvalues and edge-connectivity of regular graphs
• The Moore bound for irregular graphs
• Interlacing eigenvalues and graphs
• Isoperimetric numbers of graphs
• Laplacian spectral bounds for clique and independence numbers of graphs
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• The Laplacian Spectrum of a Graph II

This page was built for publication: Edge-connectivity and (signless) Laplacian eigenvalue of graphs