Lobe, Edge, and Arc Transitivity of Graphs of Connectivity 1
Authors:
Preprint
Abstract
We give necessary and sufficient conditions for lobe-transitivity of locally finite and locally countable graphs whose connectivity equals 1. We show further that, given any biconnected graph $\Lambda$ and a "code" assigned to each orbit of Aut($\Lambda$), there exists a unique lobe-transitive graph $\Gamma$ of connectivity 1 whose lobes are copies of $\Lambda$ and is consistent with the given code at every vertex of $\Gamma$. These results lead to necessary and sufficient conditions for a graph of connectivity $1$ to be edge-transitive and to be arc-transitive. Countable graphs of connectivity 1 the action of whose automorphism groups is, respectively, vertex-transitive, primitive, regular, Cayley, and Frobenius had been previously characterized in the literature.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Infinite Graphical Frobenius RepresentationsThe Electronic Journal of Combinatorics, 2018
- Imprimitivity of locally finite, 1-ended, planar graphsArs Mathematica Contemporanea, 2012
- A characterization of infinite planar primitive graphsJournal of Combinatorial Theory, Series B, 2004
- Infinite Vertex-Transitive, Edge-Transitive Non-1-Transitive GraphsProceedings of the American Mathematical Society, 1989
- On Edge but not Vertex Transitive Regular Graphs1987
- On the structure of infinite vertex-transitive graphsDiscrete Mathematics, 1977
- Automorphisms and endomorphisms of infinite locally finite graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1973
- Vertex and Edge Transitive, but not 1-Transitive, GraphsCanadian Mathematical Bulletin, 1970
- Regular line-symmetric graphsJournal of Combinatorial Theory, 1967