Grundy number of corona product of some graphs

• Stella Maragatham, R. ^[1] ; Subramanian, A. ^[2]
  1. [1] Queen Mary’s College.
  2. [2] Presidency College.
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 42, Nº. 5, 2023, págs. 1177-1189
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex u colored with color i, 1 ≤ i ≤ k, is adjacent to i – 1 vertices colored with each color j, 1 ≤ j ≤ i − 1. In this paper we obtain the Grundy number of corona product of some graphs, denoted by G ◦ H. First, we consider the graph G be 2-regular graph and H be a cycle, complete bipartite, ladder graph and fan graph. Also we consider the graph G and H be a complete bipartite graphs, fan graphs.