Geometric distance-regular graphs without 4-claws

DOI10.1016/j.laa.2012.07.021zbMath1257.05031arXiv1101.0440MaRDI QIDQ1932578

Yanyan Li

Publication date: 21 January 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.0440

zbMATH Keywords

smallest eigenvalue; Delsarte clique; geometric distance-regular graph; \(n\)-claw

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C12: Distance in graphs

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

On distance-regular graphs without 4-claws, On the geometricity of distance-regular graphs without 4-claws, On distance-regular graphs with smallest eigenvalue at least \(- m\), On the spectral gap and the automorphism group of distance-regular graphs, On bounding the diameter of a distance-regular graph, Geometric antipodal distance-regular graphs with a given smallest eigenvalue, Distance-regular graphs without 4-claws, Diameter bounds for geometric distance-regular graphs, On geometric distance-regular graphs with diameter three, The Koolen-Park boundary and distance-regular graphs without \(m\)-claws

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Delsarte set graphs with small \(c_{2}\)
• Shilla distance-regular graphs
• Delsarte clique graphs
• Spectral characterization of the Hamming graphs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Strongly regular graphs with smallest eigenvalue -m
• Problems in algebraic combinatorics
• Determination of the distance-regular graphs without 3-claws
• Distance-regular graphs of valency 6 and \(a_1=1\)
• Nonexistence of some antipodal distance-regular graphs of diameter four
• The regular near polygons of order \((s,2)\)
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Nonisomorphic Steiner triple systems
• GRAPHS COSPECTRAL WITH H(3, q) WHICH ARE DISJOINT UNIONS OF AT MOST THREE COMPLETE GRAPHS
• Cubic Distance-Regular Graphs
• Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist