The F26A graph is Hamiltonian.
The automorphism group of the F26A graph is a group of order 78. It acts transitively on the vertices, on the edges, and on the arcs of the graph. Therefore the F26A graph is a symmetric graph (though not distance transitive). It has automorphisms that take any vertex to any other vertex and any edge to any other edge. According to the Foster census, the F26A graph is the only cubic symmetric graph on 26 vertices. It is also a Cayley graph for the dihedral group D26, generated by a, ab, and ab4, where:
The characteristic polynomial of the F26A graph is equal to
- Weisstein, Eric W., "Cubic Symmetric Graph", MathWorld.
- Conder, M. and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41–63, 2002.
- Royle, G. F026A data
- Yan-Quan Feng and Jin Ho Kwak, Cubic s-Regular Graphs, p. 67.
- Yan-Quan Feng and Jin Ho Kwak, "One-regular cubic graphs of order a small number times a prime or a prime square," J. Aust. Math. Soc. 76 (2004), 345-356 .
Read in another language
This page is available in 1 language