✦ LIBER ✦

Automorphism group and diameter of a graph

✍ Scribed by P. Dankelmann; D. Erwin; S. Mukwembi; B. G. Rodrigues; E. Mwambene; G. Sabidussi

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 178 KB
Volume: 70
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20602

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Automorphism Groups of Covering Graphs

✍ Norbert Seifter; Vladimir I. Trofimov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

For a large class of finite Cayley graphs we construct covering graphs whose automorphism groups coincide with the groups of lifted automorphisms. As an application we present new examples of 1Â2-transitive and 1-regular graphs.

Automorphisms of Graph-Universal Coxeter

Automorphisms of Graph-Universal Coxeter Groups

✍ Bernhard Mühlherr 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Direct products of automorphism groups o

Direct products of automorphism groups of graphs

✍ Mariusz Grech 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

## Abstract In this article we study the product action of the direct product of automorphism groups of graphs. We generalize the results of Watkins [J. Combin Theory 11 (1971), 95–104], Nowitz and Watkins [Monatsh. Math. 76 (1972), 168–171] and W. Imrich [Israel J. Math. 11 (1972), 258–264], and w

Automorphism Groups of Graphs with Quadr

Automorphism Groups of Graphs with Quadratic Growth

✍ Norbert Seifter; Vladimir I. Trofimov 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Let 1 be a graph with almost transitive group Aut(1) and quadratic growth. We show that Aut(1) contains an almost transitive subgroup isomorphic to the free abelian group Z 2 .

The generalized diameter of a graph

✍ Chih-Kang Eric Chen; R. S. Garfinkel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract We generalize the concept of the diameter of a graph __G__ = (__N, A__) to allow for location of points not on the nodes. It is shown that there exists a finite set of candidate points which determine this __generalized diameter.__ Given the matrix of shortest paths, an __o__ (|__A__|^2

On the Automorphism Groups of Quasiprimi

On the Automorphism Groups of Quasiprimitive Almost Simple Graphs

✍ Xin Gui Fang; George Havas; Cheryl E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 111 KB

Let be a graph and let G be a subgroup of automorphisms of . Then G is said to be locally primitive on if, for each vertex v, the stabilizer G v induces a primitive group of permutations on the set of vertices adjacent to v. This paper investigates pairs G for which G is locally primitive on , G is