The connectivities of locally finite primitive graphs

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.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    W. Dörfler andW. Imrich, über das starke Produkt von endlichen Graphen,österr. Akad. Wiss. Math. Naturw. Kl. Sitzber. II,178 (1970), 247–262.

    Google Scholar 

  2. [2]

    W. Mader, über den Zusammenhang symmetrischer Graphen,Arch. Math.,21 (1970), 331–336.

    Article  Google Scholar 

  3. [3]

    O.Ore,The Theory of Graphs, Amer. Math. Soc. Colloq. Publ. 38, Providence, R. I., U. S. A., 1962.

  4. [4]

    H. A. Jung andM. E. Watkins, On the connectivities of finite and infinite graphs,Mh. Math.,83 (1977), 121–131.

    Article  Google Scholar 

  5. [5]

    H. A. Jung andM. E. Watkins, On the structure of infinite vertex-transitive graphs,Discrete Math.,18 (1977), 45–53.

    Article  Google Scholar 

  6. [6]

    H. A. Jung andM. E. Watkins, Fragments and automorphisms of infinite graphs,Europ. J. Combinatorics,5 (1984), 149–162.

    Google Scholar 

  7. [7]

    M. E. Watkins, Connectivity of transitive graphs,J. Combin, Th.,8 (1970), 23–29.

    Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Jung, H.A., Watkins, M.E. The connectivities of locally finite primitive graphs. Combinatorica 9, 261–267 (1989). https://doi.org/10.1007/BF02125895

Download citation

AMS subject classification (1980)

  • 05 C 25
  • 05 C 40