1-homogeneous graphs with cocktail party \({\mu}\)-graphs (Q1410769): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Jack H. Koolen / rank
Normal rank
 
Property / author
 
Property / author: Jack H. Koolen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4100097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended generalized quadrangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antipodal covering graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems in algebraic combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonexistence of some antipodal distance-regular graphs of diameter four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local approach to 1-homogeneous graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Krein parameters and antipodal tight graphs with diameter 3 and 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely regular codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characerization of a class of distance regular graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneous graphs and regular near polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs with girth 3 or 4: I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root systems and the Johnson and Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3736447 / rank
 
Normal rank

Latest revision as of 11:50, 6 June 2024

scientific article
Language Label Description Also known as
English
1-homogeneous graphs with cocktail party \({\mu}\)-graphs
scientific article

    Statements

    1-homogeneous graphs with cocktail party \({\mu}\)-graphs (English)
    0 references
    0 references
    0 references
    15 October 2003
    0 references
    0 references
    distance-regular graph
    0 references
    1-homogeneous
    0 references
    cocktail party graph
    0 references
    Johnson graph
    0 references
    Terwilliger graph
    0 references
    Schläffi graph
    0 references
    Gosset graph
    0 references