In the mathematical discipline of graph theory, Shannon multigraphs, named after Claude Shannon by Vizing (1965), are a special type of triangle graphs...

Shannon index Shannon multigraph Shannon security Shannon switching game Shannon–Fano coding Shannon–Hartley law Shannon–Hartley theorem Shannon's expansion...

showing that Vizing's theorem does not generalize to multigraphs, consider a Shannon multigraph, a multigraph with three vertices and three bundles of μ(G) parallel...

bipartite graph K1,n has the same line graph as the dipole graph and Shannon multigraph with the same number of edges. Nevertheless, analogues to Whitney's...

that every undirected multigraph without loops can be colored with at most Δ+µ colors, where µ is the multiplicity of the multigraph. The theorem is named...

problems. The kind of undirected graph considered here is often called a multigraph or pseudograph, to distinguish it from a simple graph. Gabow & Tarjan...

multidimensional" has also been used to refer to a multipartite edge-labeled multigraph. Multidimensional networks have also recently been reframed as specific...

transition) move-to-front heuristic move-to-root heuristic multi-commodity flow multigraph multilayer grid file multiplication method multiprefix multiprocessor...

colors.[V64] It is a continuation of the work of Claude Shannon, who showed that any multigraph can have its edges colored with at most (3/2)Δ colors (a...

corporations willing to retain him as counsel. Foraker represented the American Multigraph Company before the Supreme Court, seeking to overturn a Taft-backed law...