Skip to search formSkip to main contentSkip to account menu

Frucht graph

Known as: Frucht 
In the mathematical field of graph theory, the Frucht graph is a 3-regular graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
Distinguishing coloringFrucht's theoremGirth (graph theory)Graph automorphism

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
The Tutte polynomial and the automorphism group of a graph
A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no… 
2009
2009
Frucht Graph is not Hyperenergetic
If are the eigen values of a p-vertex graph , the energy of is . If , then is said to be hyperenergetic. We show that the Frucht… 
1999
1999
Simple graphs containing induced subgraphs whose automorphism groups are isomorphic to subgroups of a given finite group
1999
1999
Simple graphs containing induced subgraphs whose automorphism groups are isomorphic to subgroups of a given nite group
Given a nite group A, Frucht has given a method to construct a simple graph G whose automorphism group Aut(G) is isomorphic to to… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)