Hamiltonicity of 3-Arc Graphs

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph G is defined to have vertices the arcs of G such that two arcs uv, xy are adjacent if and only if (v, u, x, y) is a 3-arc of G. We prove that any connected 3-arc graph is hamiltonian, and all iterative 3-arc graphs of any connected graph of minimum degree at least three are hamiltonian. As a corollary we obtain that any vertex-transitive graph which is isomorphic to the 3-arc graph of a connected arc-transitive graph of degree at least three must be hamiltonian. This confirms the conjecture, for this family of vertex-transitive graphs, that all vertex-transitive graphs with finitely many exceptions are hamiltonian. We also prove that if a graph with at least four vertices is Hamilton-connected, then so are its iterative 3-arc graphs.

[1]  Sanming Zhou,et al.  Cross Ratio Graphs , 2001 .

[2]  Carsten Thomassen,et al.  Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface , 1991 .

[3]  J. A. Bondy,et al.  Basic graph theory: paths and circuits , 1996 .

[4]  Sanming Zhou,et al.  Imprimitive symmetric graphs, 3-arc graphs and 1-designs , 2002, Discret. Math..

[5]  Sanming Zhou,et al.  Finite symmetric graphs with two-arc transitive quotients , 2005, J. Comb. Theory, Ser. B.

[6]  Brian Alspach,et al.  Hamilton-Connected Cayley Graphs on Hamiltonian Groups , 2001, Eur. J. Comb..

[7]  Sanming Zhou,et al.  Diameter and connectivity of 3-arc graphs , 2010, Discret. Math..

[8]  Hong-Jian Lai,et al.  Hamilton-connected indices of graphs , 2009, Discret. Math..

[9]  Sanming Zhou,et al.  A study of 3-arc graphs , 2011, Discret. Appl. Math..

[10]  Gary Chartrand.  ON HAMILTONIAN LINE-GRAPHS(') , 1968 .

[11]  Sanming Zhou,et al.  A class of finite symmetric graphs with 2-arc transitive quotients , 2000, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  Sanming Zhou,et al.  Constructing a Class of Symmetric Graphs , 2002, Eur. J. Comb..

[13]  J. A. Bondy,et al.  Graph Theory , 2008, Graduate Texts in Mathematics.

[14]  Mingquan Zhan,et al.  Hamiltonicity of 6-connected line graphs , 2010, Discret. Appl. Math..

[15]  Camino Balbuena,et al.  On the connectivity and restricted edge-connectivity of 3-arc graphs , 2014, Discret. Appl. Math..

[16]  Sanming Zhou,et al.  Finite symmetric graphs with two-arc transitive quotients II , 2007 .

[17]  Ronald J. Gould,et al.  Advances on the Hamiltonian Problem – A Survey , 2003, Graphs Comb..

[18]  Hong-Jian Lai,et al.  Eulerian subgraphs and Hamilton-connected line graphs , 2005, Discret. Appl. Math..

[19]  Sanming Zhou.  Almost covers of 2-arc transitive graphs , 2007, Comb..

[20]  Bing Wei,et al.  Hamilton connectivity of line graphs and claw‐free graphs , 2005, J. Graph Theory.

[21]  Carsten Thomassen,et al.  Reflections on graph theory , 1986, J. Graph Theory.

[22]  C. C. Chen,et al.  On strongly hamiltonian abelian group graphs , 1981 .

[23]  Dragan Marusic,et al.  Hamilton cycles and paths in vertex-transitive graphs - Current directions , 2009, Discret. Math..