Distance-regular graphs with girth 3 or 4: I

DOI10.1016/0095-8956(85)90054-1zbMath0588.05039OpenAlexW1980890053MaRDI QIDQ1073051

Paul M. Terwilliger

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90054-1

zbMATH Keywords

distance-regular graphintersection numbers

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (18)

Intersection numbers of bipartite distance-regular graphs ⋮ On regular Terwilliger graphs with \(\mu=2\) ⋮ On distance-regular graphs with \(k_ i= k_ j\). II ⋮ On distance-regular graphs with smallest eigenvalue at least \(- m\) ⋮ A unified view of inequalities for distance-regular graphs. I ⋮ Exceptional graphs with smallest eigenvalue -2 and related problems ⋮ Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\) ⋮ 1-homogeneous graphs with cocktail party \({\mu}\)-graphs ⋮ Dual polar spaces as extremal distance-regular graphs. ⋮ The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs ⋮ On distance-transitive graphs and involutions ⋮ A characterization of the Hamming graph by strongly closed subgraphs ⋮ A characterization of Johnson and Hamming graphs and proof of Babai's conjecture ⋮ The distance-regular graphs such that all of its second largest local eigenvalues are at most one ⋮ Root systems and the Johnson and Hamming graphs ⋮ A characterization of one class of graphs without 3-claws ⋮ Linear groups and distance-transitive graphs ⋮ A class of distance-regular graphs that are \(\phi\)-polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automorphic graphs and the Krein condition
• There are only finitely many finite distance-transitive graphs of given valency greater than two
• Distance-regular graphs and (s,c,a,k)-graphs
• A generalization of Moore graphs of diameter two
• Locally petersen graphs

This page was built for publication: Distance-regular graphs with girth 3 or 4: I