Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
F26A graph
Summary
In the mathematical field of graph theory, the F26A graph is a symmetric bipartite cubic graph with 26 vertices and 39 edges.
It has chromatic number 2, chromatic index 3, diameter 5, radius 5 and girth 6. It is also a 3-vertex-connected and 3-edge-connected graph.
The F26A graph is Hamiltonian and can be described by the LCF notation [−7, 7]13.
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 F26A graph is the smallest cubic graph where the automorphism group acts regularly on arcs (that is, on edges considered as having a direction).
The characteristic polynomial of the F26A graph is equal to
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.
Image:F26A graph 2COL.svg |The [[chromatic number]] of the F26A graph is 2.
Image:F26A graph 3color edge.svg|The [[chromatic index]] of the F26A graph is 3.
Image:F26A graph alt.svg|Alternative drawing of the F26A graph.
File:F026 graph embedded in torus.svg|F26A graph embedded in the [[torus]].
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.