Grundy number of corona product of two graphs

Grundy number of corona product of two graphs

Christen and Selkow named and analyzed the Grundy number for the first time in 1979. The Grundy number is the maximum number of colors used to color the vertices of a graph G. We explore the relationship between the Grundy number of corona product graphs and its complement in this paper and also, we...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Christy, D. K. Sheena, Mani, L. Ebenezar Muthu
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithms
Apexes
Graph theory
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Christen and Selkow named and analyzed the Grundy number for the first time in 1979. The Grundy number is the maximum number of colors used to color the vertices of a graph G. We explore the relationship between the Grundy number of corona product graphs and its complement in this paper and also, we analyse the bounds of the Grundy number of a corona product of graphs with paths, cycles, and complete graphs. We have given algorithm to find Grundy number of a coronaproduct of two graphs by knowing the Grundy number of individual graphs.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0164549