{
  "abstract": "Aldous and Fill (2002) conjectured that the maximum relaxation time of a random walk on a connected regular graph with $n$ vertices is bounded above by $(1+o(1))\\frac{3n^2}{2π^2}$, with asymptotic equality for even $n$. Since the relaxation time of a $d$-regular graph $G$ is $d/μ(G)$, where $μ(G)$ denotes its algebraic connectivity, this conjecture is closely related to the problem of minimizing algebraic connectivity among regular graphs. Guiduli and Mohar (1996) conjectured that, for every fixed minimum degree $δ=d\\ge 3$ and all sufficiently large orders, graphs with minimum algebraic connectivity are path-like and, apart from bounded portions near their two ends, have a prescribed block structure. For fixed odd degree $d\\ge 3$, Abdi and Ghorbani (2004) conjectured that $d$-regular graphs with minimum algebraic connectivity have the same structure. We prove the Aldous--Fill conjecture and the Guiduli--Mohar conjecture, as well as the corresponding conjecture for $d$-regular graphs of fixed odd degree. Finally, we prove that, for every fixed odd degree $d\\ge 3$, $d$-regular graphs, as well as graphs of fixed minimum degree $d\\ge 3$, whose algebraic connectivity is asymptotically minimum have asymptotically maximum diameter. This establishes the corresponding cases of another conjecture of Abdi and Ghorbani.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.26699",
  "author_total": 2,
  "authors": [
    {
      "name": "Maryam Abdi"
    },
    {
      "name": "Ebrahim Ghorbani"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/etawm5pz47fms.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.26699",
  "fulltext_url": null,
  "id": "etawm5pz47fms",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.26699",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2608|Graph theory and applications"
    ]
  ],
  "openalex": "W7214115105",
  "pdf_url": "https://arxiv.org/pdf/2609.26699",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-22",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/etawm5pz47fms.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:23:43Z",
      "native_id": "2609.26699",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.26699"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Graphs with Minimum Algebraic Connectivity I: Proofs of Aldous-Fill and Guiduli-Mohar Conjectures",
  "title_text": "Graphs with Minimum Algebraic Connectivity I: Proofs of Aldous-Fill and Guiduli-Mohar Conjectures",
  "type": "preprint",
  "updated_at": "2026-10-30T12:23:43Z",
  "url": "https://research.draconitic.com/paper/etawm5pz47fms",
  "venue": "arXiv",
  "versions": []
}