Subtopic Deep Dive
Distance-Regular Graphs
Research Guide
What is Distance-Regular Graphs?
Distance-regular graphs are regular graphs where the number of vertices at distance i from a given vertex is constant for all vertices, characterized by their intersection array.
Research focuses on classification via intersection arrays and Bose-Mesner algebras. Key connections exist to association schemes and P- and Q-polynomial schemes. Over 10 papers from the list address constructions and classifications, with Terwilliger's 1992 work cited 411 times.
Why It Matters
Distance-regular graphs unify strongly regular graphs and symmetric designs, enabling constructions of high-girth graphs used in network design and coding theory (Lazebnik et al., 1995; Biggs, 1998). They support analysis of association schemes for combinatorial designs in cryptography and error-correcting codes (Terwilliger, 1992; van Dam, 1999). Applications include classifying subsets in Grassmann graphs for quantum information processing (Tanaka, 2005).
Key Research Challenges
Classifying Unknown Intersection Arrays
Determining which intersection arrays correspond to existing distance-regular graphs remains open beyond diameter 3. Terwilliger's subconstituent algebra provides tools but leaves many parameters unresolved (Terwilliger, 1992). Computational searches yield candidates but lack proofs of existence.
Constructing High-Girth Examples
Building distance-regular graphs with large girth and minimal vertices challenges known bounds like μ₀(g). Lazebnik et al. introduced polarities for dense high-girth graphs, but cubic cases need more constructions (Lazebnik et al., 1995; Biggs, 1998).
Analyzing Bose-Mesner Algebras
Computing eigenvalues and multiplicities in Bose-Mesner algebras for new schemes is complex. Works on Leonard pairs and three-class schemes advance structure theory but struggle with higher classes (Terwilliger, 2002; van Dam, 1999).
Essential Papers
The Subconstituent Algebra of an Association Scheme, (Part I)
Paul Terwilliger · 1992 · Journal of Algebraic Combinatorics · 411 citations
A new series of dense graphs of high girth
Felix Lazebnik, V. A. Ustimenko, Andrew J. Woldar · 1995 · Bulletin of the American Mathematical Society · 256 citations
Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="k greater-than-or-equal-to 1"> <mml:semantics> <mml:mrow> <mml:mi>k</mml:mi> <mml:m...
An inverse theorem for the Gowers U^(s+1)[N]-norm
Ben Green, Terence Tao, Tamar Ziegler · 2012 · Annals of Mathematics · 148 citations
We prove the inverse conjecture for the Gowers U s+1 [N ]-norm for all s 1; this is new for s 4.More precisely, we establish that if f :then there is a boundedcomplexity s-step nilsequence F (g(n)Γ...
Leonard Pairs from 24 Points of View
Paul Terwilliger · 2002 · Rocky Mountain Journal of Mathematics · 122 citations
We define a symmetric binary relation on S 4 called adjacency.An element wxyz of S 4 is by definition adjacent to each of xwyz, wyxz, wxzy and no other elements of S 4 .For all ordered pairs of adj...
Constructions for Cubic Graphs with Large Girth
Norman Biggs · 1998 · The Electronic Journal of Combinatorics · 112 citations
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer $\mu_0(g)$, the smallest number of vertices for whi...
Three-Class Association Schemes
Edwin van Dam · 1999 · Journal of Algebraic Combinatorics · 102 citations
Codes and Projective Multisets
S.M. Dodunekov, Juriaan Simonis · 1998 · The Electronic Journal of Combinatorics · 101 citations
The paper gives a matrix-free presentation of the correspondence between full-length linear codes and projective multisets. It generalizes the Brouwer-Van Eupen construction that transforms project...
Reading Guide
Foundational Papers
Start with Terwilliger (1992) for subconstituent algebras as core theory (411 citations), then Lazebnik et al. (1995) for constructions (256 citations), followed by Godsil and Hensel (1992) for covers.
Recent Advances
Tanaka (2005) on Grassmann classifications; Braun et al. (2016) for q-analogs relating to schemes.
Core Methods
Intersection arrays for parameters; Bose-Mesner algebras for eigenspaces; Leonard pairs for tridiagonal structures (Terwilliger, 2002).
How PapersFlow Helps You Research Distance-Regular Graphs
Discover & Search
Research Agent uses searchPapers('distance-regular graphs intersection array') to find Terwilliger (1992), then citationGraph to map 411 citations and findSimilarPapers for Godsil and Hensel (1992) on covers.
Analyze & Verify
Analysis Agent applies readPaperContent on Lazebnik et al. (1995) to extract girth constructions, verifyResponse with CoVe against Biggs (1998), and runPythonAnalysis to compute μ₀(g) bounds via NumPy, graded by GRADE for eigenvalue accuracy.
Synthesize & Write
Synthesis Agent detects gaps in high-girth classifications from Terwilliger (2002) and van Dam (1999), while Writing Agent uses latexEditText for proofs, latexSyncCitations for 10+ papers, and exportMermaid for intersection array diagrams.
Use Cases
"Compute girth bounds for cubic distance-regular graphs using Biggs constructions."
Research Agent → searchPapers → Analysis Agent → runPythonAnalysis (NumPy girth simulation) → matplotlib plot of μ₀(g).
"Write LaTeX section on Terwilliger's subconstituent algebra for association schemes."
Research Agent → citationGraph → Synthesis Agent → gap detection → Writing Agent → latexEditText + latexSyncCitations + latexCompile → PDF with Bose-Mesner algebra proofs.
"Find GitHub code for Lazebnik-Ustimenko high-girth graph generators."
Research Agent → exaSearch('Lazebnik graph generator') → Code Discovery → paperExtractUrls → paperFindGithubRepo → githubRepoInspect → runnable Python implementation.
Automated Workflows
Deep Research scans 50+ papers via searchPapers on 'distance-regular graphs', building structured report with citationGraph from Terwilliger (1992). DeepScan applies 7-step CoVe checkpoints to verify intersection array claims in Godsil and Hensel (1992). Theorizer generates hypotheses for new P-polynomial schemes from van Dam (1999) patterns.
Frequently Asked Questions
What defines a distance-regular graph?
A distance-regular graph has constant intersection numbers p_{ij}^k for distances i,j from vertex k. Intersection arrays fully parameterize them.
What are main methods in this research?
Bose-Mesner algebras compute eigenvalues; subconstituent algebras classify parameters (Terwilliger, 1992). Association schemes provide dual frameworks.
What are key papers?
Terwilliger (1992, 411 citations) on subconstituent algebras; Lazebnik et al. (1995, 256 citations) on high-girth series; Godsil and Hensel (1992, 95 citations) on complete graph covers.
What open problems exist?
Classify all graphs with given intersection arrays beyond diameter 3. Construct minimal high-girth examples matching μ₀(g) (Biggs, 1998).
Research Finite Group Theory Research with AI
PapersFlow provides specialized AI tools for Mathematics researchers. Here are the most relevant for this topic:
AI Literature Review
Automate paper discovery and synthesis across 474M+ papers
Paper Summarizer
Get structured summaries of any paper in seconds
AI Academic Writing
Write research papers with AI assistance and LaTeX support
See how researchers in Physics & Mathematics use PapersFlow
Field-specific workflows, example queries, and use cases.
Start Researching Distance-Regular Graphs with AI
Search 474M+ papers, run AI-powered literature reviews, and write with integrated citations — all in one workspace.
See how PapersFlow works for Mathematics researchers
Part of the Finite Group Theory Research Research Guide