✦ LIBER ✦

On bounded automorphisms of locally finite transitive graphs

✍ Scribed by Niemeyer, Peter

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 517 KB
Volume: 22
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199608)22:4<357::aid-jgt9>3.0.co;2-k

No coin nor oath required. For personal study only.

✦ Synopsis

The automorphism-group of an infinite graph acts in a natural way on the set of d-fibers (components of the set of rays with respect to the Hausdorff metric). For connected, locally finite, almost transitive graphs the kernel of this action is proved to be the group of bounded automorphisms. This completes a result of Moller, who characterized the bounded automorphisms of connected, locally finite, transitive graphs with infinitely many ends.

📜 SIMILAR VOLUMES

On Finite s-Transitive Graphs of Odd Ord

On Finite s-Transitive Graphs of Odd Order

✍ Cai Heng Li 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 128 KB

It is shown that, for a positive integer s, there exists an s-transitive graph of odd order if and only if s 3 and that, for s=2 or 3, an s-transitive graph of odd order is a normal cover of a graph for which there is an automorphism group that is almost simple and s-transitive.

On the hamiltonicity of line graphs of l

On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs

✍ Richard C. Brewster; Daryl Funk 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

## Abstract The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a

On the Isomorphism Problem for Finite Ca

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

✍ C.H. Li; C.E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each σ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S σ ). For a positive integer m, th

Remarks on Path-transitivity in Finite G

Remarks on Path-transitivity in Finite Graphs

✍ Marston D.E. Conder; Cheryl E. Praeger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 244 KB

Bounding the Exponent of a Finite Group

Bounding the Exponent of a Finite Group with Automorphisms

✍ E.I Khukhro; P Shumyatsky 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 98 KB

On bounded treewidth duality of graphs

✍ Ne?et?il, Jaroslav; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 734 KB

For a graph H , the H-coloring problem is to decide whether or not an instance graph G is homomorphic to H . The H-coloring problem is said to have bounded treewidth duality if there is an integer k such that for any graph G which is not homomorphic to H , there is a graph F of treewidth k which is