DOIAbstract
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinite locally finite connected graph with more than one end 2-distance-transitivity implies distance-transitivity
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinite locally finite connected graph with more than one end 2-distance-transitivity implies distance-transitivity
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
AbstractLetPbe a double ray in an infinite graphX, and letdanddPdenote the distance functions inXand...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinit...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive gra...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
Abstract. We give an example of an infinite, vertex transitive graph that has the following property...
AbstractEvery 1-transitive finite or infinite graph is clearly both vertex-transitive and edge-trans...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
A non-complete graph Γ is said to be (G, 2)-distance-transitive if, for i = 1, 2 and for any two ver...
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
AbstractLetPbe a double ray in an infinite graphX, and letdanddPdenote the distance functions inXand...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractWe give a positive answer to a question of Thomassen and Woess; we prove that for an infinit...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
The result of the title is proved, assuming the truth of Sims' conjecture on primitive permutation g...
In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive gra...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
AbstractThis paper describes some classes of infinite distance-transitive graphs. It has no pretensi...
Abstract. We give an example of an infinite, vertex transitive graph that has the following property...
AbstractEvery 1-transitive finite or infinite graph is clearly both vertex-transitive and edge-trans...
Abstract. We give a unified approach to analysing, for each positive integer s, a class of finite co...
A non-complete graph Γ is said to be (G, 2)-distance-transitive if, for i = 1, 2 and for any two ver...
AbstractWe give certain properties which are satisfied by the descendant set of a vertex in an infin...
AbstractLetPbe a double ray in an infinite graphX, and letdanddPdenote the distance functions inXand...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
Add to ORKG