Wong graph

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Wong graph
Named afterPak-Ken Wong
Vertices30
Edges75
Radius3
Diameter3
Girth5
Automorphisms96
Chromatic number4
Chromatic index5
PropertiesCage
Table of graphs and parameters

In the mathematical field of graph theory, the Wong graph is a 5-regular undirected graph with 30 vertices and 75 edges.[1][2] It is one of the four (5,5)-cage graphs, the others being the Foster cage, the Meringer graph, and the Robertson–Wegner graph.

Like the unrelated Harries–Wong graph, it is named after Pak-Ken Wong.[3]

It has chromatic number 4, diameter 3, and is 5-vertex-connected.

Algebraic properties

[edit | edit source]

The characteristic polynomial of the Wong graph is

(x5)(x+1)2(x25)3(x1)5(x2+x5)8.

References

[edit | edit source]
  1. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value).
  2. ^ Lua error in Module:Citation/CS1/Configuration at line 2172: attempt to index field '?' (a nil value)..
  3. ^ Wong, P. K. "Cages--A Survey." J. Graph Th. 6, 1-22, 1982.