1-homogeneous graphs with cocktail party \({\mu}\)-graphs

DOI10.1023/A:1025133213542zbMath1038.05059MaRDI QIDQ1410769

Jack H. Koolen, Aleksandar Jurišić

Publication date: 15 October 2003

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graph; Johnson graph; Terwilliger graph; 1-homogeneous; cocktail party graph; Gosset graph; Schläffi graph

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

Related Items

Homogeneity of a distance-regular graph which supports a spin model, The pseudo-cosine sequences of a distance-regular graph, Distance-regular graphs with complete multipartite \(\mu\)-graphs and AT4 family, On graphs with complete multipartite \(\mu \)-graphs, On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph, 1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs, Taut distance-regular graphs of even diameter, Taut distance-regular graphs of odd diameter, The subconstituent algebra of a strongly regular graph, Classification of the family AT4(\(qs,q,q\)) of antipodal tight graphs, Taut distance-regular graphs and the subconstituent algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extended generalized quadrangles
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• Distance-regular graphs with girth 3 or 4: I
• Completely regular codes
• Homogeneous graphs and regular near polygons
• Problems in algebraic combinatorics
• Krein parameters and antipodal tight graphs with diameter 3 and 4
• Nonexistence of some antipodal distance-regular graphs of diameter four
• Tight distance-regular graphs
• Root systems and the Johnson and Hamming graphs
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Antipodal covering graphs
• Characerization of a class of distance regular graphs.
• On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
• A local approach to 1-homogeneous graphs