/manager/Index ${session.getAttribute("locale")} 5 On automorphism groups of graph truncations /manager/Repository/uon:28295 t on t vertices. We determine necessary and sufficient conditions for T(Γ) to be hamiltonian, show Aut(T(Γ)) ≅ Aut(Γ), as well as show that if Γ  is vertex-transitive, then T(Γ ) is vertex-transitive if and only if Γ  is arc-transitive. Finally, in the case where t is prime we determine necessary and sufficient conditions for T(Γ) to be isomorphic to a Cayley graph as well as an additional necessary and sufficient condition for T(Γ) to be vertex-transitive.]]> Wed 11 Apr 2018 16:03:05 AEST ]]> On factorisations of complete graphs into circulant graphs and the Oberwolfach problem /manager/Repository/uon:24862 Wed 11 Apr 2018 15:38:54 AEST ]]> Hamilton paths in Cayley graphs on Coxeter groups: I /manager/Repository/uon:28294 n, Bn, and Dn with regard to the problem of whether they are Hamilton-laceable or Hamilton-connected. It is known that every connected bipartite Cayley graph on An, n ≥ 2, whose connection set contains only transpositions and has valency at least three is Hamilton-laceable. We obtain analogous results for connected bipartite Cayley graphs on Bn, and for connected Cayley graphs on Dn. Non-bipartite examples arise for the latter family.]]> Thu 17 Sep 2020 09:45:52 AEST ]]>