On the regulation number of a multigraph (Q1068843)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the regulation number of a multigraph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the regulation number of a multigraph |
scientific article |
Statements
On the regulation number of a multigraph (English)
0 references
1985
0 references
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.
0 references
regular multigraph
0 references
regulation number
0 references
additional vertices
0 references
