## Abstract We establish natural bijections between three different classes of combinatorial objects; namely certain families of locally 2βarc transitive graphs, partial linear spaces, and homogeneous factorizations of arcβtransitive graphs. Moreover, the bijections intertwine the actions of the re
Covering spaces of locally homogeneous graphs
β Scribed by Roman Nedela
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 818 KB
- Volume
- 121
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A graph is called locally homogeneous if the subgraphs induced at any two points are isomorphic. in this Note we give a method for constructing locally homogeneous graphs from groups. the graphs constructable in this way are exactly the locally homogeneous graphs with a point symmetric
The aim of this paper is to construct a graph G on n vertices which is a connected covering graph but has 2O(") diagram orientations. This provides a negative answer to a question of I. Rival.
For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1Γ2-transitive and 1-regular graphs.