// Workers AI · dad joke modeWhat did the F26A graph say? I've got a lot of points.
| F26A graph | |
|---|---|
 The F26A graph is Hamiltonian. | |
| Vertices | 26 |
| Edges | 39 |
| Radius | 5 |
| Diameter | 5 |
| Girth | 6 |
| Automorphisms | 78 (C13⋊C6) |
| Chromatic number | 2 |
| Chromatic index | 3 |
| Properties | Cayley graph Symmetric Cubic Hamiltonian[1] |
| Table of graphs and parameters | |
In the mathematical field of graph theory, the F26A graph is a symmetric bipartite cubic graph with 26 vertices and 39 edges.[1]
It has chromatic number 2, chromatic index 3, diameter 5, radius 5 and girth 6.[2] It is also a 3-vertex-connected and 3-edge-connected graph. The graph is 1-planar.[3]
The F26A graph is Hamiltonian and can be described by the LCF notation [−7, 7]13.
Algebraic properties
[edit]The automorphism group of the F26A graph is a group of order 78.[4] 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.[2] It is also a Cayley graph for the dihedral group D26, generated by a, ab, and ab4, where:[5]
The F26A graph is the smallest cubic graph where the automorphism group acts regularly on arcs (that is, on edges considered as having a direction).[6]
The characteristic polynomial of the F26A graph is equal to
Other properties
[edit]The F26A graph can be embedded as a chiral regular map in the torus, with 13 hexagonal faces. The dual graph for this embedding is isomorphic to the Paley graph of order 13.
Gallery
[edit]
The chromatic number of the F26A graph is 2.
The chromatic index of the F26A graph is 3.
Alternative drawing of the F26A graph.
F26A graph embedded in the torus.
References
[edit]- 1 2 Weisstein, Eric W. "Cubic Symmetric Graph". MathWorld.
- 1 2 Conder, M. and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41–63, 2002.
- ↑ Pupyrev, Sergey (2025), "OOPS: Optimized One-Planarity Solver via SAT", in Dujmović, Vida; Montecchiani, Fabrizio (eds.), Proc. 33rd International Symposium on Graph Drawing and Network Visualization (GD 2025), Leibniz International Proceedings in Informatics (LIPIcs), vol. 357, pp. 14:1–14:19, doi:10.4230/LIPIcs.GD.2025.14, ISBN 978-3-95977-403-1.
- ↑ Royle, G. F026A data
- ↑ "Yan-Quan Feng and Jin Ho Kwak, Cubic s-Regular Graphs, p. 67" (PDF). Archived from the original (PDF) on 2006-08-26. Retrieved 2010-03-12.
- ↑ 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 .