Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures

DOI10.1016/J.JCTB.2024.02.005MaRDI QIDQ6500102zbMATH OpenFDO

Authors Maryam Abdi, E. Ghorbani

Publication date 10 May 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

relaxation timespectral gapalgebraic connectivitymaximum diameter

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40) Random walks on graphs (05C81)

Recommendations

• Graphs of degree at least \({3}\) with minimum algebraic connectivity
• Quartic graphs with minimum spectral gap
• Proof of conjectures involving algebraic connectivity of graphs
• Regular graphs with minimum spectral gap
• The maximum relaxation time of a random walk

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Graphs of maximum diameter
• Maximum diameter of regular digraphs
• On the diameter of a graph
• Quartic graphs with minimum spectral gap
• Radius, diameter, and minimum degree
• Regular graphs with minimum spectral gap
• The maximum relaxation time of a random walk
• The structure of trivalent graphs with minimal eigenvalue gap

Cited in

(2)

• Graphs of degree at least \({3}\) with minimum algebraic connectivity
• Attainable bounds for algebraic connectivity and maximally connected regular graphs

This page was built for publication: Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures

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