Edge-connectivity and (signless) Laplacian eigenvalue of graphs

DOI10.1016/J.LAA.2013.10.017MaRDI QIDQ2435574zbMATH OpenOpenAlexFDO

Authors Huiqing Liu, Mei Lu, Feng Tian

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

edge-connectivitygirthLaplacian eigenvaluesignless Laplacian eigenvalue

Mathematics Subject Classification ID

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

Recommendations

• Vertex-connectivity and eigenvalues of graphs
• Vertex-connectivity and eigenvalues of graphs with fixed girth
• Eigenvalues and edge-connectivity of regular graphs
• On the bounds of Laplacian eigenvalues of \(k\)-connected graphs.
• Connectivity and eigenvalues of graphs with given girth or clique number

Cites work

• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Bounds of Laplacian spectrum of graphs based on the domination number
• Eigenvalues and edge-connectivity of regular graphs
• scientific article; zbMATH DE number 1054729 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• 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
• Minimum cuts, girth and a spectral threshold
• Signless Laplacians of finite graphs
• Spectra of graphs
• The Laplacian Spectrum of a Graph II
• The Moore bound for irregular graphs
• Unoriented Laplacian maximizing graphs are degree maximal

Cited in

(17)

• Edge addition, singular values, and energy of graphs and matrices
• Bounds on the independence number and signless Laplacian index of graphs
• Spectral radius and \(k\)-connectedness of a graph
• The effect on eigenvalues of connected graphs by adding edges
• Vertex-connectivity and eigenvalues of graphs with fixed girth
• Connectivity and eigenvalues of graphs with given girth or clique number
• Vertex-connectivity and eigenvalues of graphs
• Spanning tree packing number and eigenvalues of graphs with given girth
• Edge perturbation on graphs with clusters: adjacency, Laplacian and signless Laplacian eigenvalues
• The Laplacian quadratic form and edge connectivity of a graph
• On the bounds of Laplacian eigenvalues of \(k\)-connected graphs.
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree
• New sufficient spectral conditions on \(k\)-edge-connected graph
• Spectral conditions for some graphical properties
• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• The \(Q\)-index and connectivity of graphs
• Bounds on the second largest eigenvalue of graphs in relation to clique and chromatic numbers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2435574)