Shannon-Multigraph

With Shannon multigraph or shear Shannon multigraph ( after Claude Elwood Shannon ) refers to a special kind of graphs in graph theory, they are there, especially in the theory of edge-colorings of importance.

A multi- graph with three corners, which are each connected with the same number of edges, or in addition, has a yet further additional edge is referred to as Shannon - Multigraph. More precisely it is called the Shannon - multigraph Sh ( n ), when the three corners by, and edges are connected.

For even n, the Shannon multigraph accepts the upper limit in the set of Vizing and Shannon's Theorem and proves therefore that these estimates are optimal in some sense.

• Shannon multigraph

Sh ( 3)

Sh ( 4)

Sh ( 5)

Sh (6 )

Sh ( 7)