On the regulation number of a multigraph (Q1068843): Difference between revisions

The regulation number r(G) of a multigraph G with maximum degree d is the minimum number of additional vertices that are required to construct a d- regular supermultigraph of G. It is shown that r(G)\(\leq 3\) or 2 if G is a multigraph or multidigraph, respectively. Also multigraphs with a given maximum multiplicity of edges are considered.