Open Access

On degree sets in k-partite graphs

T. A. Naikoo

T. A. Naikoo

Islamia College of Science and CommerceSrinagar, India
Search for this author on
Sciendo|Google Scholar
Naikoo, T. A.
, 
U. Samee

U. Samee

Institute of Technology, University of KashmirSrinagar, India
Search for this author on
Sciendo|Google Scholar
Samee, U.
, 
S. Pirzada

S. Pirzada

University of KashmirSrinagar, India
Search for this author on
Sciendo|Google Scholar
Pirzada, S.
 and 
Bilal A. Rather

Bilal A. Rather

Department of Mathematics, University of KashmirIndia
Search for this author on
Sciendo|Google Scholar
Rather, Bilal A.
  
Jan 29, 2021
On degree sets in k-partite graphs's Cover Image
About this article
Previous Article
Next Article
Cite
Download Cover
Published Online: Jan 29, 2021
Page range: 251 - 259
Received: Oct 19, 2020
Accepted: Nov 06, 2020
DOI: https://doi.org/10.2478/ausi-2020-0015
Keywords
© 2020 T. A. Naikoo et al., published by Sciendo
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

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.

Language:
English
Publication timeframe:
2 times per year
Journal Subjects:
Computer Sciences, Computer Sciences, other
Journal RSS Feed