Abstract
The degree set of a k-partite graph is the set of distinct degrees of its vertices. We prove that every set of non-negative integers is a degree set of some k-partite graph.
The degree set of a k-partite graph is the set of distinct degrees of its vertices. We prove that every set of non-negative integers is a degree set of some k-partite graph.
© 2021 T. A. Naikoo, U. Samee, S. Pirzada, Bilal A. Rather, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.