Chromatic completion number

Kok, J.; Mphako-Banda, E.G.

doi:10.28919/jmcs/5028

J. Math. Comput. Sci. 10 (2020), 2971–2983

Chromatic completion number

J. Kok, E.G. Mphako-Banda

PDF (158.8 KB) https://doi.org/10.28919/jmcs/5028

Abstract

The well known concept of proper vertex colouring of a graph is used to introduce the construction of a chromatic completion graph and determining its related parameter, the chromatic completion number of a graph. The chromatic completion numbers of certain classes of cycle derivative graphs and helm graphs are then presented. Finally, we discuss further problems for research related to this concept.

Published: 3 November 2020
Volume: 10 (2020)
License: CC BY 3.0

Copyright © 2020 J. Kok, E.G. Mphako-Banda. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Cite this article

J. Kok, E. G. Mphako-Banda, Chromatic completion number, J. Math. Comput. Sci. 10 (2020), 2971–2983. https://doi.org/10.28919/jmcs/5028

BibTeX

@article{Kok2020,
  author  = {Kok, J. and Mphako-Banda, E.G.},
  title   = {Chromatic completion number},
  journal = {J. Math. Comput. Sci.},
  volume  = {10},
  year    = {2020},
  pages   = {2971--2983},
  doi     = {10.28919/jmcs/5028}
}