The Wong graph is a 5-regular undirected graph with 30 vertices and 75 edges [1] [2] . The graph is one of four (5.5) cells , the other three are the Foster cell , the Mehringer graph and the Robertson-Wegner graph .
| Count Wong | |
|---|---|
 Count Wong | |
| Named after | Pak-Ken Wong |
| Top | thirty |
| Riber | 75 |
| Diameter | 3 |
| Girth | five |
| Automorphisms | 96 |
| Chromatic number | four |
| Chromatic Index | five |
| The properties | Cell |
Like (not connected with this graph) Harris-Wong graph, the graph is named after Pak-Ken Wong [3] .
The graph has a chromatic number of 4, a diameter of 3, and it is vertex 5-connected .
Algebraic properties
The characteristic polynomial of a graph is
Literature
- ↑ Weisstein, Eric W. Wong Graph on the Wolfram MathWorld website.
- ↑ Markus Meringer. Fast generation of regular graphs and construction of cages // Journal of Graph Theory . - 1999. - T. 30 , no. 2 . - S. 137–146 . - DOI : 10.1002 / (SICI) 1097-0118 (199902) 30: 2 <137 :: AID-JGT7> 3.0.CO; 2-G .
- ↑ Wong PK Cages - A Survey // J. Graph Th .. - 1982. - Issue. 6 . - S. 1-22 .