Proof of conjecture involving algebraic connectivity and average degree of graphs

DOI10.1016/j.laa.2018.03.006zbMath1385.05046OpenAlexW2793052931WikidataQ122978872 ScholiaQ122978872MaRDI QIDQ1748082

Xianqiang Yang

Publication date: 2 May 2018

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

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

zbMATH Keywords

diameteraverage degreealgebraic connectivitylargest Laplacian eigenvalue

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

2-connected graphs with the minimum algebraic connectivity

Uses Software

• SageMath
• AutoGraphiX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjectures on index and algebraic connectivity of graphs
• Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number
• A survey of automated conjectures in spectral graph theory
• The Laplacian spectral radius of some graphs
• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• Laplacian matrices of graphs: A survey
• An improved upper bound for Laplacian graph eigenvalues
• The Laplacian spectrum of a graph
• Proof of conjectures involving algebraic connectivity of graphs
• On the conjecture for certain Laplacian integral spectrum of graphs

This page was built for publication: Proof of conjecture involving algebraic connectivity and average degree of graphs