Distance Sequences of Locally Infinite Primitive Graphs
From MaRDI portal
Abstract: A graph is called primitive if its automorphism group acts primitively on the vertex set. In this paper, we prove a classification of the possible distance sequences of locally infinite primitive graphs. In particular we show that if a primitive graph is locally uncountable, the distance sequence is constant until it terminates. We also prove a constraint on the distance sequences of locally finite infinite graphs.
This page was built for publication: Distance Sequences of Locally Infinite Primitive Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6349730)
