| Information | |
|---|---|
| has gloss | eng: 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. Its description was first published by , who wrote that it had been discovered in 1932 by Marion Cameron Gray. |
| lexicalization | eng: Gray graph |
| instance of | (noun) (computer science) the organization of data (and its storage allocations in a computer) data structure |
| Meaning | |
|---|---|
| French | |
| has gloss | fra: Le graphe de Gray est, en théorie des graphes, un graphe 3-régulier possédant 54 sommets et 81 arêtes. |
| lexicalization | fra: graphe de Gray |
| Media | |
|---|---|
| media:img | Gray graph hamiltonian.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint