𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Metric ends, fibers and automorphisms of graphs

✍ Scribed by Bernhard Krön; Rögnvaldur G. Möller


Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
180 KB
Volume
281
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

Several results on the action of graph automorphisms on ends and fibers are generalized for the case of metric ends. This includes results on the action of the automorphisms on the end space, directions of automorphisms, double rays which are invariant under a power of an automorphism and metrically almost transitive automorphism groups. It is proved that the bounded automorphisms of a metrically almost transitive graph with more than one end are precisely the kernel of the action on the space of metric ends. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)


📜 SIMILAR VOLUMES


Chromatic automorphisms and symmetries o
✍ S. Stueckle 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

Certain colored graphs are defined in terms of permutations in S, and the edge-chromatic automorphism groups of these graphs are studied. In fact, these groups are characterized in terms of the associated permutations. These groups are related to the groups of symmetries of certain drawings of cycle

Metric characterizations of proper inter
✍ Gutierrez, M.; Oubi�a, L. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB 👁 2 views

A connected graph G is a tree-clique graph if there exists a spanning tree T (a compatible tree) such that every clique of G is a subtree of T. When Tis a path the connected graph G is a proper interval graph which is usually defined as intersection graph of a family of closed intervals of the real

Cartesian Products of Graphs and Metric
✍ S. Avgustinovich; D. Fon-Der-Flaass 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 68 KB

We prove uniqueness of decomposition of a finite metric space into a product of metric spaces for a wide class of product operations. In particular, this gives the positive answer to the long-standing question of S. Ulam: 'If U × U V × V with U , V compact metric spaces, will then U and V be isometr

Automorphism group and diameter of a gra
✍ P. Dankelmann; D. Erwin; S. Mukwembi; B. G. Rodrigues; E. Mwambene; G. Sabidussi 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 178 KB 👁 1 views

## Abstract Given a connected graph Γ of order __n__ and diameter __d__, we establish a tight upper bound for the order of the automorphism group of Γ as a function of __n__ and __d__, and determine the graphs for which the bound is attained. © 2011 Wiley Periodicals, Inc. J Graph Theory.