Meringer graph

From testwiki
Revision as of 01:44, 24 July 2024 by imported>Entranced98 (Importing Wikidata short description: "Graph with 30 vertices and 75 edges")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Context Template:Infobox graph In the mathematical field of graph theory, the Meringer graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Markus Meringer.[1][2]

It is one of the four (5,5)-cage graphs, the others being the Foster cage, the Robertson–Wegner graph, and the Wong graph.

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

Algebraic properties

The characteristic polynomial of the Meringer graph is

(x5)(x2)9x(x+2)3(x+3)2(x2+x4)3(x2+2x2)4.

References

Template:Reflist