Article ID Journal Published Year Pages File Type
4649082 Discrete Mathematics 2007 13 Pages PDF
Abstract

We define the mobility of a graph automorphism as the minimum distance between a vertex of the graph and its image under the automorphism, and the absolute mobility of a graph as the maximum of the mobilities of its automorphisms. In this paper, we investigate the mobility of certain classes of graphs, in particular, Cartesian and lexicographic products, vertex-transitive graphs, and Cayley graphs.

Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , ,