1-homogeneous graphs with cocktail party \({\mu}\)-graphs
type: Item
instance of: scholarly article
title: 1-homogeneous graphs with cocktail party \({\mu}\)-graphs
zbMATH Open document ID: 1038.05059
DOI: 10.1023/A:1025133213542
author: Aleksandar Jurišić
author: Jack H. Koolen
published in: Journal of Algebraic Combinatorics
publication date: 2003-10-15T00:00:00Z
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 1993166
zbMATH Keywords: distance-regular graph
zbMATH Keywords: 1-homogeneous
zbMATH Keywords: cocktail party graph
zbMATH Keywords: Johnson graph
zbMATH Keywords: Terwilliger graph
zbMATH Keywords: Schläffi graph
zbMATH Keywords: Gosset graph
MaRDI profile type: Publication
cites work: On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
cites work: Q3992965
cites work: Q4100097
cites work: Extended generalized quadrangles
cites work: Q5707657
cites work: Antipodal covering graphs
cites work: Problems in algebraic combinatorics
cites work: Nonexistence of some antipodal distance-regular graphs of diameter four
cites work: Tight distance-regular graphs
cites work: A local approach to 1-homogeneous graphs
cites work: Krein parameters and antipodal tight graphs with diameter 3 and 4
cites work: Completely regular codes
cites work: Characerization of a class of distance regular graphs.
cites work: Homogeneous graphs and regular near polygons
cites work: Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
cites work: Q4099518
cites work: Distance-regular graphs with girth 3 or 4: I
cites work: The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
cites work: Root systems and the Johnson and Hamming graphs
cites work: Q3736447
description: scientific article; zbMATH DE number 1993166