Further results on the enumeration of Hamilton paths in Cayley digraphs on semidirect products of cyclic groups (Q952650): Difference between revisions

The Cayley digraph on a group \(G\) with generating set \(S\), denoted by Cay\((G : S)\), is the digraph with vertex set \(G\) and arc set containing an arc from \(g\) to \(gs\) whenever \(g \in G\) and \(s \in S\). Two main results are proved: (1) If \(G\) is the semidirect product of cyclic groups given by \(G = \mathcal Z_{8m} \times| \mathcal Z_{2n} = \langle x,y: x^{8m}=1, y^{2n}=1, yxy^{-1}=x^{4m+1} \rangle\) where \(m\) and \(n\) are coprime positive integers then the number of hamilton paths in Cay\((G : x,y)\) (with initial vertex 1) is one fewer than the number of visible lattice points that lie on the closed quadrilateral whose vertices in consecutive order are \((0,0)\), \((4mn^2+2n, 16m^2n)\), \((n, 4m)\), and \((0, 8m)\). (2) If \(G\) is the semidirect product of cyclic groups given by \(G = \mathcal Z_{4m} \times| \mathcal Z_{2n} = \langle x,y: x^{4m}=1, y^{2n}=1, yxy^{-1}=x^{2m-1} \rangle\) where \(m\) and \(n\) are positive integers with \(n\) odd then the number of hamilton paths in Cay\((G : x,y)\) (with initial vertex 1) is \((3m-1)n+m\lfloor(n+1)/3\rfloor+1\).