Affiliation:
1. Eötvös Loránd University, Faculty of Informatics, Budapest, Hungary
2. University of Kashmir, Srinagar, India
Abstract
Abstract
If k ≥ 1, then the global degree set of a k-partite graph G = (V
1, V
2, . . . , V
k, E) is the set of the distinct degrees of the vertices of G, while if k ≥ 2, then the distributed degree set of G is the family of the k degree sets of the vertices of the parts of G. We propose algorithms to construct bipartite and tripartite graphs with prescribed global and distributed degree sets consisting from arbitrary nonnegative integers. We also present a review of the similar known results on digraphs.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On degree sets in k-partite graphs;Acta Universitatis Sapientiae, Informatica;2020-12-01
2. On imbalances in multipartite multidigraphs;Electronic Journal of Graph Theory and Applications;2018-04-03