On degree sets in k-partite graphs-Reference-Cited by-同舟云学术

On degree sets in k-partite graphs

Published:2020-12-01 Issue:2 Volume:12 Page:251-259
ISSN:2066-7760
Container-title:Acta Universitatis Sapientiae, Informatica
language:en
Short-container-title:

Author:

Naikoo T. A.¹,Samee U.²,Pirzada S.³,Rather Bilal A.⁴

Affiliation:

1. Islamia College of Science and Commerce , Srinagar , India

2. Institute of Technology , University of Kashmir , Srinagar , India

3. University of Kashmir , Srinagar , India

4. Department of Mathematics , University of Kashmir , India

Abstract

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.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/ausi-2020-0015

Reference31 articles.

1. [1] T. S. Ahuja, A. Tripathi, On the order of a graph with a given degree set. J. Comb. Math. Comb. Comput., 57 (2006) 157–162. ⇒252

2. [2] G. Chartrand, R. J. Gould, S. F. Kapoor, Graphs with prescribed degree sets and girth, Periodica Math. Hung., 12, 4 (1981) 261–266. ⇒25210.1007/BF01849614

3. [3] A. A. Chernyak, Minimal graphs with a given degree set and girth (Russian), Vestsi Akad. Navuk BSSR Ser. Fiz.-Mat. Navuk,1988, 2 21–25, 123. ⇒252

4. [4] F. Harary, E. Harzheim, The degree sets of connected infinite graphs. Fund. Math., 118, 3 (1983) 233–236. ⇒25210.4064/fm-118-3-233-236

5. [5] A. Iványi, J. Elek, Degree sets of tournaments, Studia Univ. Babe¸s-Bolyai, Informatica, 59 (2014) 150–164. ⇒252

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exact and approximate results on the least size of a graph with a given degree set;Discrete Applied Mathematics;2023-07