Abstract
A graphG isn-degree uniform if for every nonnegative integerr, there are either no vertices of degreer orn vertices of degreer. For any integern≥2, a necessary and sufficient condition for a (finite, nonempty) set of positive integers to be the degree set of ann-degree uniform graph is given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Behzad, M., Chartrand, G., Lesniak-Foster, L.: Graphs & Digraphs. Boston: Prindle, Weber & Schmidt 1979.
Chartrand, G., Lesniak, L., Mynhardt, C.M., Oellermann, O.R.: Degree uniform graphs (submitted for publication)
Erdös, P., Gallai, T.: Graphs with prescribed degrees of vertices. Mat. Lapok (in Hungarian)11, 264–274 (1960).
Kapoor, S.F., Polimeni, A.D., Wall, C.E.: Degree sets for graphs. Fundamenta Mathematicae95, 189–194 (1977).
Author information
Authors and Affiliations
Additional information
Research supported in part by the South African Council for Scientific and Industrial Research
Rights and permissions
About this article
Cite this article
Mynhardt, C.M. Degree sets of degree uniform graphs. Graphs and Combinatorics 1, 283–290 (1985). https://doi.org/10.1007/BF02582953
Issue Date:
DOI: https://doi.org/10.1007/BF02582953