A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices (Q3225724): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q129353403, #quickstatements; #temporary_batch_1726262144271
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mikhail H. Klin / rank
Normal rank
 
Property / author
 
Property / author: Mikhail H. Klin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRAPE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.26493/1855-3974.191.16b / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1927756328 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129353403 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:24, 13 September 2024

scientific article
Language Label Description Also known as
English
A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
scientific article

    Statements

    A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices (English)
    0 references
    0 references
    0 references
    22 March 2012
    0 references
    antipodal graph
    0 references
    distance regular cover
    0 references
    automorphism group
    0 references
    generalized Hadamard matrix
    0 references
    Godsil-Hensel matrix
    0 references
    conference matrix
    0 references
    Foster graph
    0 references
    resolvable transversal design
    0 references
    semibiplane
    0 references
    Taylor graph
    0 references
    two-graph
    0 references
    0 references
    0 references
    0 references

    Identifiers

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