Abstract
Letγ be an infinite, locally finite graph whose automorphism group is primitive on its vertex set. It is shown that the connectivity ofγ cannot equal 2, but all other values 0, 1, 3, 4, ... are possible.
Similar content being viewed by others
References
W. Dörfler andW. Imrich, über das starke Produkt von endlichen Graphen,österr. Akad. Wiss. Math. Naturw. Kl. Sitzber. II,178 (1970), 247–262.
W. Mader, über den Zusammenhang symmetrischer Graphen,Arch. Math.,21 (1970), 331–336.
O.Ore,The Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence, R. I., U. S. A., 1962.
H. A. Jung andM. E. Watkins, On the connectivities of finite and infinite graphs,Mh. Math.,83 (1977), 121–131.
H. A. Jung andM. E. Watkins, On the structure of infinite vertex-transitive graphs,Discrete Math.,18 (1977), 45–53.
H. A. Jung andM. E. Watkins, Fragments and automorphisms of infinite graphs,Europ. J. Combinatorics,5 (1984), 149–162.
M. E. Watkins, Connectivity of transitive graphs,J. Combin, Th.,8 (1970), 23–29.