<abstract xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></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.

On degree sets in k-partite graphs

Acta Universitatis Sapientiae, Informatica

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

{"article-title":"On degree sets in k-partite graphs"}

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...

On degree sets in k-partite graphs

Pubblicato online: 29 gen 2021

Pagine: 251 - 259

Ricevuto: 19 ott 2020

Accettato: 06 nov 2020

DOI: https://doi.org/10.2478/ausi-2020-0015

Parole chiave
bipartite graph, k-partite graph, degree, degree set

© 2020 T. A. Naikoo et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

On degree sets in k-partite graphs

Pubblicato online: 29 gen 2021

Pagine: 251 - 259

Ricevuto: 19 ott 2020

Accettato: 06 nov 2020

DOI: https://doi.org/10.2478/ausi-2020-0015

Parole chiavebipartite graph, k-partite graph, degree, degree set

© 2020 T. A. Naikoo et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Parole chiave
bipartite graph, k-partite graph, degree, degree set