graphe de Gray
Sign in to saveundirected bipartite graph with 54 vertices and 81 edges
In the Vinony graph
Within Vinony's link graph, graphe de Gray is referenced by 16 other articles, and connects out to mathematics, digital object identifier and graph theory.
Vinony files it under Configurations (geometry), Individual graphs and Regular graphs.
Its subject is documented across 5 Wikipedia language editions.
Wikidata facts
- Image
- Gray graph hamiltonian.svg
- Has parts of class
- edge
Show 9 more facts
- maintained by WikiProject
- WikiProject Mathematics
- graph radius
- 6
- described at URL
- aeb.win.tue.nl/graphs/Gray.html
- discoverer or inventor
- Marion Cameron Gray
- has characteristic
- radius
- studied by
- graph theory
- graph diameter
- 6
- graph girth
- 8
- Commons category
- Gray graph
Sources (1)
via Wikidata · CC0
Article · Français
Le graphe de Gray est, en théorie des graphes, un graphe 3-régulier possédant 54 sommets et 81 arêtes. Il tire son nom de Marion Cameron Gray qui le découvrit en 1932 ; il fut publié pour la première fois par I. Z. Bouwer en 1968.
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
mathematics
Entity
digital object identifier
Entity
graph theory
Entity
graph
Entity
arXiv
Entity
MathWorld
Entity
Semantic Scholar
Entity
node
Entity
graph coloring
Entity
planar graph
Entity
Hamiltonian path
Entity
bipartite graph
Entity
Eric W. Weisstein
Entity
cycle
Entity
University of New Brunswick
Entity
glossary of graph theory terms
Entity
graph distance
Entity
girth
Entity
cubic graph
Entity
edge coloring
Entity