“Robertson–Wegner graph”的意思、由来-开放百科全书

词条

Robertson–Wegner graph

释义

Algebraic properties
References

{{infobox graph
| name = Robertson–Wegner graph
| namesake = Neil Robertson
| vertices = 30
| edges = 75
| automorphisms = 20
| girth = 5
| diameter = 3
| radius = 3
| chromatic_number = 4
| chromatic_index = 5^[1]
| properties = Cage
|image=Robertson–Wegner graph.svg}}

In the mathematical field of graph theory, the Robertson–Wegner graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Neil Robertson and G. Wegner.^[2]^[3]^[4]

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

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

Algebraic properties

The characteristic polynomial of the Robertson–Wegner graph is

References

1. ^{{MathWorld|urlname=Class2Graph|title=Class 2 Graph}}
2. ^{{MathWorld|urlname=Robertson-WegnerGraph|title=Robertson–Wegner Graph}}
3. ^Bondy, J. A. and Murty, U. S. R. Graph Theory with Applications. New York: North Holland, p. 238, 1976.
4. ^Wong, P. K. "A note on a paper of G. Wegner", Journal of Combinatorial Theory, Series B, 22:3, June 1977, pgs 302-303, doi:10.1016/0095-8956(77)90081-8

2 : Individual graphs|Regular graphs

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。