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.
Algebraic properties
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:
: D_{26} = \langle a, b | a^2 = b^{13} = 1, ab

Official source

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.

Related publications

Loading

Related people

Loading

Related units

Loading

Related concepts

Loading

Related courses

Loading

Related lectures

Loading

Related publications

Related concepts

Related people

No results

No results

No results

Related units

Related courses

Related lectures

No results

No results

No results