Title :
On equivalence of realizability conditions of a degree sequence
fDate :
5/1/1973 12:00:00 AM
Abstract :
It is shown that the realizability conditions of Erdös and Gallai for a sequence of nonnegative integers to be the degrees of a graph having no parallel edges and self-loops can be deduced from those for a directed graph.
Keywords :
Graph theory; Special issue short papers; Australia; Councils; Geography; Government; Network address translation; Printers; Statistics; Transportation; Uncertainty; Water resources;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1973.1083683
