A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
On automorphism groups of graph truncations
2014
Ars Mathematica Contemporanea
It is well known that the Petersen graph, the Coxeter graph, as well as the graphs obtained from these two graphs by replacing each vertex with a triangle, are trivalent vertextransitive graphs without Hamilton cycles, and are indeed the only known connected vertextransitive graphs of valency at least two without Hamilton cycles. It is known by many that the replacement of a vertex with a triangle in a trivalent vertex-transitive graph results in a vertex-transitive graph if and only if the
doi:10.26493/1855-3974.665.4b6
fatcat:pnhxhcg2zvdfjamdsy6rlal6gm