The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results (Q2364627): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs having strongly regular subconstituents / rank
 
Normal rank
Property / cites work
 
Property / cites work: The uniqueness of the strongly regular graph \(\mathrm{srg}(105,32,4,12)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of some strongly regular subgraphs of the McLaughlin graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antipodal covering graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance regular covers of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Regular Graphs Derived from Combinatorial Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vector enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach to fundamental groups and covers of combinatorial cell complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three new distance-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-regular graphs / rank
 
Normal rank

Latest revision as of 04:48, 14 July 2024

scientific article
Language Label Description Also known as
English
The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
scientific article

    Statements

    The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results (English)
    0 references
    21 July 2017
    0 references
    distance-regular graph
    0 references
    strongly regular graph
    0 references
    antipodal cover
    0 references
    fundamental group
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references