Primitivity and ends of graphs

Rögnvaldur G. Möller*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

A graph X is said to be primitive if its automorphism group G acts primitively on the vertex set VX; that is, the only G-invariant equivalence relations on VX are the one where all the classes have size one and the equivalence relation which has only one class, the whole of VX. We investigate the end structure of locally finite primitive graphs. Our main result shows that it has a very simple description; in particular, locally finite primitive graphs are accessible in the sense of Thomassen and Woess.

Original languageEnglish
Pages (from-to)477-484
Number of pages8
JournalCombinatorica
Volume14
Issue number4
DOIs
Publication statusPublished - Dec 1994

Other keywords

  • AMS subject classification code (1991): 05C25, 20B15, 20B27

Fingerprint

Dive into the research topics of 'Primitivity and ends of graphs'. Together they form a unique fingerprint.

Cite this