Antipodal distance transitive covers of complete graphs (Q1266355): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: DBLP publication ID (P1635): journals/ejc/GodsilLP98, #quickstatements; #temporary_batch_1731462974821
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/eujc.1997.0190 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983508827 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ejc/GodsilLP98 / rank
 
Normal rank

Revision as of 03:04, 13 November 2024

scientific article
Language Label Description Also known as
English
Antipodal distance transitive covers of complete graphs
scientific article

    Statements

    Antipodal distance transitive covers of complete graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 June 1999
    0 references
    This paper contributes to the effort to determine all finite distance-transitive graphs, focusing on antipodal graphs. A graph \(X\) is antipodal if the graph \(X_d\) is disconnected, where \(X_d\) is a graph on the vertices of \(X\) with two vertices joined by an edge iff they are distance \(d\) apart in X, \(d\) being the diameter of \(X\). A distance-transitive graph \(X\) is either bipartite, antipodal, or \(X_r\) is connected for all \(r\) with \(1 \leq r \leq d\). The authors list all antipodal distance-transitive graphs whose antipodal quotient is complete.
    0 references
    antipodal graph
    0 references
    distance-transitive
    0 references

    Identifiers