Vertex-transitive graphs
β Scribed by Gert Sabidussi
- Publisher
- Springer Vienna
- Year
- 1964
- Tongue
- English
- Weight
- 642 KB
- Volume
- 68
- Category
- Article
- ISSN
- 0026-9255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We prove that every connected vertexβtransitive graph on __n__ β₯ 4 vertices has a cycle longer than (3__n__)^1/2^. The correct order of magnitude of the longest cycle seems to be a very hard question.
Let G be a group acting symmetrically on a graph 2, let G, be a subgroup of G minimal among those that act symmetrically on 8, and let G2 be a subgroup of G, maximal among those normal subgroups of GI which contain no member except 1 which fixes a vertex of Z. The most precise result of this paper i
The Petersen graph on 10 vertices is the smallest example of a vertex-transitive graph that is not a Cayley graph. In 1983, D. MaruSiE asked, "For what values of n does there exist such a graph on n vertices?" We give several new constructions of families of vertex-transitive graphs that are not Cay