1 citations · 2 across the 6 of their papers we have counts for
6 papers
Graphs with Minimum Algebraic Connectivity II: Regular Graphs of Even Degree
Maryam Abdi, Ebrahim Ghorbani
Aldous and Fill (2002) conjectured the asymptotic maximum relaxation time of a random walk on a connected regular graph. Since the relaxation time of a -regular graph is $d/…
Graphs with Minimum Algebraic Connectivity I: Proofs of Aldous-Fill and Guiduli-Mohar Conjectures
Maryam Abdi, Ebrahim Ghorbani
Aldous and Fill (2002) conjectured that the maximum relaxation time of a random walk on a connected regular graph with vertices is bounded above by ,…
Minimum algebraic connectivity and maximum diameter: Aldous--Fill and Guiduli--Mohar conjectures
Maryam Abdi, Ebrahim Ghorbani
Aldous and Fill (2002) conjectured that the maximum relaxation time for the random walk on a connected regular graph with vertices is . A conjec…
Gap sets for the spectra of regular graphs with minimum spectral gap
Maryam Abdi, Ebrahim Ghorbani
Following recent work by Kollár and Sarnak, we study gaps in the spectra of large connected cubic and quartic graphs with minimum spectral gap. We focus on two sequences of graphs,…
Quartic Graphs with Minimum Spectral Gap
Maryam Abdi, Ebrahim Ghorbani
Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with vertices is . This conjecture can…
Regular Graphs with Minimum Spectral Gap
M. Abdi, E. Ghorbani, W. Imrich
Aldous and Fill conjectured that the maximum relaxation time for the random walk on a connected regular graph with vertices is . This conjecture can…