граф Фрухта
Sign in to save3-регулярный граф с 12 вершинами и 18 рёбрами без нетривиальных симметрий
In the Vinony graph
Vinony's link graph records 14 inbound references to граф Фрухта, and connects out to Hamiltonian path, glossary of graph theory terms and International Standard Book Number.
It is catalogued under topics including Individual graphs, Planar graphs and Regular graphs.
Vinony links it to 6 Wikipedia language editions.
Wikidata facts
- Instance of
- asymmetric graph
- Named after
- Robert Frucht
- Image
- Frucht planar Lombardi.svg
- Has parts of class
- edge
Show 6 more facts
- graph radius
- 3
- Commons category
- Frucht graph
- studied by
- graph theory
- graph diameter
- 4
- graph girth
- 3
- maintained by WikiProject
- WikiProject Mathematics
Sources (2)
via Wikidata · CC0
Article · Русский
Граф Фрухта — один из двух минимальных кубических графов, не имеющих нетривиальных автоморфизмов.Описан Робертом Фрухтом в 1939.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
Hamiltonian path
Entity
glossary of graph theory terms
Entity
International Standard Book Number
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
group
Entity
graph theory
Entity
arXiv
Entity
MathWorld
Entity
Semantic Scholar
Entity
node
Entity
graph coloring
Entity
Wiley
Entity
degree
Entity
characteristic polynomial
Entity
regular graph
Entity
Eric W. Weisstein
Entity
trivial group
Entity
Mathematical Reviews
Entity
zbMATH Open
Entity