1 citations · 2 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
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/…
math.CO2026
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 ,…