Antipodal distance transitive covers of complete graphs
type: Item
instance of: scholarly article
title: Antipodal distance transitive covers of complete graphs
zbMATH Open document ID: 0914.05035
author: Robert A. Liebler
author: Cheryl E. Praeger
author: Chris Godsil
published in: European Journal of Combinatorics
publication date: 1999-06-06T00:00:00Z
review text: 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.
reviewed by: Brigitte Servatius
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 1199927
zbMATH Keywords: antipodal graph
zbMATH Keywords: distance-transitive
Wikidata QID: Q56988119
MaRDI profile type: Publication
full work available at URL: eujc.1997.0190
OpenAlex ID: W1983508827
DBLP publication ID: journals/ejc/GodsilLP98
DOI: 10.1006/EUJC.1997.0190
description: scientific article; zbMATH DE number 1199927