496 research outputs found
Line graphs and -geodesic transitivity
For a graph , a positive integer and a subgroup G\leq
\Aut(\Gamma), we prove that is transitive on the set of -arcs of
if and only if has girth at least and is
transitive on the set of -geodesics of its line graph. As applications,
we first prove that the only non-complete locally cyclic -geodesic
transitive graphs are the complete multipartite graph and the
icosahedron. Secondly we classify 2-geodesic transitive graphs of valency 4 and
girth 3, and determine which of them are geodesic transitive
Symmetry properties of subdivision graphs
The subdivision graph of a graph is obtained from
by `adding a vertex' in the middle of every edge of \Si. Various
symmetry properties of are studied. We prove that, for a connected
graph , is locally -arc transitive if and only if
is -arc transitive. The diameter of
is , where has diameter and , and local -distance transitivity of is
defined for . In the general case where
we prove that is locally -distance transitive
if and only if is -arc transitive. For the
remaining values of , namely , we classify
the graphs for which is locally -distance transitive in
the cases, and . The cases remain open
- …