On \delta^(k)-colouring of Powers of Paths and Cycles

In a proper vertex colouring of a graph, the vertices are coloured in such a way that no two adjacent vertices receive the same colour, whereas in an improper vertex colouring, adjacent vertices are permitted to receive same colours subjected to some conditions. An edge of an improperly coloured gra...

Full description

Bibliographic Details
Main Authors: Merlin Ellumkalayil, Sudev Naduvath
Format: Article
Language:English
Published: Georgia Southern University 2021-08-01
Series:Theory and Applications of Graphs
Subjects:
Online Access:https://digitalcommons.georgiasouthern.edu/tag/vol8/iss2/3