Skip to search formSkip to main contentSkip to account menu

Distance-transitive graph

Known as: Distance transitive graph, Distance-transitive graphs 
In the mathematical field of graph theory, a distance-transitive graph is a graph such that, given any two vertices v and w at any distance i, and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations

Broader (1)

Algebraic graph theory
Distance (graph theory)Distance-regular graphDodecahedronGirth (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
On $s$-distance-transitive graphs
Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and… 
2013
2013
Antipodal distance-transitive covers with primitive quotient of diameter two
2006
2006
Some results on weakly distance-transitive graphs
Weakly distance-transitive graphs are discussed.It is proved that bipartite graphs are weakly distance-transitive.Weak distance… 
2006
2006
Analyzing Disturbed Di usion on Networks ?
This work provides the rst detailed investigation of the disturbed di usion scheme FOS/C introduced in [17] as a type of di usion… 
1991
1991
On distance-transitive graphs and involutions
We present a new result on distance-transitive graphs and show how it can be used in the case where the vertex stabilizer is the… 
Review
1991
Review
1991
Prospective classification of distance-transitive graphs
The present state of the art in the classification of distance-transitive graphs is surveyed. A detailed treatment is given of… 
1991
1991
On the Classification of Locally Hamming Distance-Regular Graphs
. A distance-regular graph is locally Hamming if it is locally isomorphic to a Hamming scheme $H(r, 2)$ . This paper rediscovers… 
1987
1987
Distance-transitive graphs of valency five
If u and v are vertices of the (finite, connected) graph Γ, let d(u, v) denote the length of the shortest path joining u to v in… 
1984
1984
Distance-transitive graphs and the problem of maximal subgroups of symmetric groups
We give a necessary and sufficient condition for the automorphism group of a distance-transitive graph to be a maximal… 
1976
1976
An improved version of Lloyd's theorem
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)