6 citations · 24 across the 33 of their papers we have counts for
42 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 ,…
Kemeny's constant via matrix compression and eigenvalue interlacing
A. Abiad, Á. Carmona, A. M. Encinas +3
Kemeny's constant quantifies the expected time for a random walk to reach a randomly chosen vertex, capturing global properties of a Markov chain. We develop a matrix-analytic fram…
Menger's Theorem in bidirected graphs
Nathan Bowler, Ebrahim Ghorbani, Florian Gut +2
Bidirected graphs are a generalisation of directed graphs that arises in the study of undirected graphs with perfect matchings. Menger's famous theorem - the minimum size of a set…
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…
Matching integral 2-connected graphs
Ebrahim Ghorbani
In this note we present an infinite family of 2-connected graphs such that their matching polynomials have only integer zeros. This answers in negative a question of Akbari et al.…