✦ LIBER ✦

A note on infinite transitive graphs

✍ Scribed by Norbert Seifter

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 250 KB
Volume: 58
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90151-2

No coin nor oath required. For personal study only.

✦ Synopsis

In [4] Jung and Watkins proved that for a connected infinite graph X either r®(X) = oo holds or X is a strip, if Aut(X) contains a transitive abelian subgroup G. Here we prove the same result under weaker assumptions.

📜 SIMILAR VOLUMES

A note on the growth of transitive graph

A note on the growth of transitive graphs

✍ W. Imrich; N. Seifter 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 810 KB

Let X be a locally finite, connected, growth if and only if X is a strip. infinite, transitive graph. We show that X has linear X(V, E) denotes a graph with vertex-set V(X) and edge-set E(X). Graphs considered in this paper contain neither loops nor mu!tiple edges, AUT(X) denotes the automorphism gr

A Note on Intertwines of Infinite Graphs

✍ B. Oporowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 224 KB

We present a construction of two infinite graphs \(G_{1}, G_{2}\) and of an infinite set of graphs such that \(\mathscr{F}\) is an antichain with respect to the minor relation and, for every graph \(G\) in \(\mathscr{F}\), both \(G_{1}\) and \(G_{2}\) are subgraphs of \(G\) but no graph obtained fro

Note on vertex-partitions of infinite gr

Note on vertex-partitions of infinite graphs

✍ János Pach; Joel H. Spencer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Given an infinite graph G, let deg,(G) be defined as the smallest d for which V(G) can be partitioned into finite subsets of (uniformly) bounded size such that each part is adjacent to at most d others. A countable graph G is constructed with de&(G) > 2 and with the property that [{y~V(G):d(x, y)sn}

A Note on Transitive Equivalence

✍ John Hickman 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

Note on Infinite Families of Trivalent S

Note on Infinite Families of Trivalent Semisymmetric Graphs

✍ Seymour Lipschutz; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

A simple undirected graph is said to be semisymmetric if it is regular and edge-transitive but not vertex-transitive. This paper uses the groups PSL(2, p) and PGL(2, p), where p is a prime, to construct two new infinite families of trivalent semisymmetric graphs.

Distance-Transitivity in Infinite Graphs

✍ R.G. Moller 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 178 KB

We give a positive answer to a question of Thomassen and Woess; we prove that for an infinite locally finite connected graph with more than one end 2-distancetransitivity implies distance-transitivity. 1994 Academic Press, Iлc.