Contract grant sponsor: ARC Discovery Project.
On Finite 2-Path-Transitive Graphs
Article first published online: 18 JUN 2012
© 2012 Wiley Periodicals, Inc.
Journal of Graph Theory
Volume 73, Issue 2, pages 225–237, June 2013
How to Cite
Li, C. H. and Zhang, H. (2013), On Finite 2-Path-Transitive Graphs. J. Graph Theory, 73: 225–237. doi: 10.1002/jgt.21672
- Issue published online: 1 APR 2013
- Article first published online: 18 JUN 2012
- Manuscript Revised: 6 APR 2012
- Manuscript Received: 2 JUN 2011
- symmetric graphs;
- half-transitive graphs;
The class of graphs that are 2-path-transitive but not 2-arc-transitive is investigated. The amalgams for such graphs are determined, and structural information regarding the full automorphism groups is given. It is then proved that a graph is 2-path-transitive but not 2-arc-transitive if and only if its line graph is half-arc-transitive, thus providing a method for constructing new families of half-arc-transitive graphs. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 225–237, 2013