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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Merlin Ellumkalayil, Sudev Naduvath
Formato: article
Lenguaje:EN
Publicado: Georgia Southern University 2021
Materias:
Acceso en línea:https://doaj.org/article/6fb2331bcd664f60b2c7dcc6cf1decde
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!