EUVIMEDEUVIMED entdecken
Crossref

A STUDY ON -HUED COLOURING OF PRISM GRAPH FAMILIES

S. Palaniammal, V. C. Thilak Rajkumar

Advances and Applications in Discrete Mathematics · 2025

DOI: 10.17654/0974165825033 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances and Applications in Discrete Mathematics, 2025. Verfasst von S. Palaniammal und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let be a simple, connected, undirected, and finite graph with vertex set and edge set . For a positive integer , a proper -colouring of is called an -hued colouring if, for each vertex , where denotes the neighbourhood of and is the degree of . The minimum that allows an -hued colouring of with colours is referred to as the -hued chromatic number of , denoted by . In this paper, we determine the -hued chromatic number for several graph classes: the -crossed prism graph , the line graph of , denoted , the prism graph , and the antiprism graph .

Zitieren

APA

Palaniammal, S., & Rajkumar, V. C. T. (2025). A STUDY ON -HUED COLOURING OF PRISM GRAPH FAMILIES. Advances and Applications in Discrete Mathematics. https://doi.org/10.17654/0974165825033

Vancouver

Palaniammal S, Rajkumar VCT. A STUDY ON -HUED COLOURING OF PRISM GRAPH FAMILIES. Advances and Applications in Discrete Mathematics. 2025. doi:10.17654/0974165825033

BibTeX
@article{Palaniammal2025,
  author = {Palaniammal, S. and Rajkumar, V. C. Thilak},
  title = {A STUDY ON -HUED COLOURING OF PRISM GRAPH FAMILIES},
  journal = {Advances and Applications in Discrete Mathematics},
  year = {2025},
  doi = {10.17654/0974165825033}
}
Kostenlos starten →