Wong graph

Undirected graph with 30 vertices and 75 edges From Wikipedia, the free encyclopedia

Wong graph

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.

Quick Facts Named after, Vertices ...
Close

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

The characteristic polynomial of the Wong graph is

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.