Skip to content
Surf Wiki
Save to docs
general/individual-graphs

From Surf Wiki (app.surf) — the open knowledge base

F26A graph


FieldValue
nameF26A graph
image[[File:F26A graph.svg220px]]
image_captionThe F26A graph is Hamiltonian.
vertices26
edges39
automorphisms78 (C13⋊C6)
girth6
diameter5
radius5
chromatic_number2
chromatic_index3
propertiesCayley graph
Symmetric
Cubic
Hamiltonian

Symmetric Cubic Hamiltonian 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 graph is 1-planar.{{citation | editor-first1 = Vida | editor-last1 = Dujmović | editor-first2 = Fabrizio | editor-last2 = Montecchiani

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, aba = b^{-1} \rangle .

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

: (x-3)(x+3)(x^4-5x^2+3)^6. ,

Other properties

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.

References

References

  1. "Cubic Symmetric Graph".
  2. [[Marston Conder. Conder, M.]] and Dobcsányi, P. "Trivalent Symmetric Graphs Up to 768 Vertices." J. Combin. Math. Combin. Comput. 40, 41–63, 2002.
  3. Royle, G. [http://school.maths.uwa.edu.au/~gordon/remote/foster/F026A.html F026A data]
  4. "Yan-Quan Feng and Jin Ho Kwak, ''Cubic s-Regular Graphs'', p. 67.".
  5. 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 [http://www.austms.org.au/Publ/JAustMS/V76P3/y16.html].
Info: Wikipedia Source

This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.

Want to explore this topic further?

Ask Mako anything about F26A graph — get instant answers, deeper analysis, and related topics.

Research with Mako

Free with your Surf account

Content sourced from Wikipedia, available under CC BY-SA 4.0.

This content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.

Report