Research any topic before you write.
Find related topics. | Discover entities. | See connections. | Build a topical map.
In the mathematical field of graph theory, the Gray graph is an undirected bipartite graph with 54 vertices and 81 edges. It is a cubic graph: every vertex touches exactly three edges. It was discovered by Marion C. Gray in 1932 (unpublished), then discovered independently by Bouwer 1968 in reply to a question posed by Jon Folkman 1967. The Gray graph is…
Art, Construction & Overview
Explore the main themes, entities and connections around Gray graph. Start with the topic map, then use the sections below for research and deeper semantic analysis.
Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.
High-confidence facts extracted from structured source data. Use them as anchors for further research.
Browse the full topic structure. Each item opens a new analysis centered on that subject.
Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.
See the strongest relationship patterns around the current topic before diving into the raw triples.
Use these terms to understand the vocabulary surrounding the topic, not as a checklist for keyword stuffing.
graph gray cubic vertices edges bouwer vertex pisanski doi graphs 10 theory edge bipartite marušič points journal algebraic chromatic index
| Subject | Predicate | Object | Confidence | Src |
|---|---|---|---|---|
| Gray graph | Automorphisms | 1296 | 1.00 | infobox |
| Gray graph | Book thickness | 3 | 1.00 | infobox |
| Gray graph | Chromatic index | 3 | 1.00 | infobox |
| Gray graph | Chromatic number | 2 | 1.00 | infobox |
| Gray graph | Diameter | 6 | 1.00 | infobox |
| Gray graph | Edges | 81 | 1.00 | infobox |
| Gray graph | Genus | 7 | 1.00 | infobox |
| Gray graph | Girth | 8 | 1.00 | infobox |
| Gray graph | Named after | Marion Cameron Gray | 1.00 | infobox |
| Gray graph | Properties | Cubic Semi-symmetric Hamiltonian Bipartite | 1.00 | infobox |
| Gray graph | Queue number | 2 | 1.00 | infobox |
| Gray graph | Radius | 6 | 1.00 | infobox |
| Gray graph | Vertices | 54 | 1.00 | infobox |
| Gray graph | is a | undirected bipartite graph with 54 vertices and 81 edges | 0.90 | text |
| Gray graph | is a | Levi graph of this configuration | 0.90 | text |
| Gray graph | is a | group of order 1296 | 0.90 | text |
| Gray graph | is a | semi-symmetric graph | 0.90 | text |
| Gray graph | is a | Smallest Graph of Its Kind | 0.90 | text |
These clusters group vocabulary that occurs around closely connected concepts in the source material.
Bridges can reveal useful research angles that are easy to miss in a flat list of related terms.