Frucht graph
id:
frucht-graph-259-15019146
title:
Frucht graph
text:
In the mathematical field of graph theory, the Frucht graph is a cubic graph with 12 vertices, 18 edges, and no nontrivial symmetries. It was first described by Robert Frucht in 1939. The Frucht graph is a pancyclic, Halin graph with chromatic number 3, chromatic index 3, radius 3, and diameter 4. Like every Halin graph, the Frucht graph is polyhedral and Hamiltonian, with girth 3. Its independence number is 5. The Frucht graph can be constructed from the LCF notation: [−5,−2,−4,2,5,−2,2,5,−2,−5
brand slug:
wiki
category slug:
encyclopedia
description:
Cubic graph with 12 vertices and 18 edges
original url:
https://en.wikipedia.org/wiki/Frucht_graph
date created:
date modified:
2023-11-20T15:39:23Z
main entity:
{"identifier":"Q2061755","url":"https://www.wikidata.org/entity/Q2061755"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/b5/Frucht_planar_Lombardi.svg","width":123,"height":123}
fields total:
13
integrity:
15