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
• DOI: 10.22199/issn.0717-6279-4962
• 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.

• Referencias bibliográficas
  • C. Berge, Graphs and Hypergraphs. North Holland, 1973.
  • Y. Caro, A. Sebö and M. Tarsi, “Recognizing greedy structures”, Journal of Algorithms, vol. 20, no. 1, pp. 137-156, 1996. https://doi.org/10.1006/jagm.1996.0006
  • C.A. Christen and S.M. Selkow, “Some perfect coloring properties of graphs”, Journal of Combinatorial Theory, Series B, vol. 27, no. 1, pp....
  • J.E. Dunbar, S.M. Hedetniemi, S.T. Hedetniemi, D.P. Jacobs, J. Knisely, R.C. Laskar and D.F. Rall, “Fall Colorings of Graphs”, Journal of...
  • P. Erdös, W.R. Hare, S.T. Hedetniemi and R. Laskar, “On the equality of Grundy and ochromatic number of graphs”, Journal of Graph Theory,...
  • R. Frucht and F. Harary, “On the corona of two graphs”, Aequationes Mathematicae, vol. 4, pp. 322-325, 1970. https://doi.org/10.1007/BF01844162
  • Z. Füredi, A. Gyárfás, G. Sárközy and S. Selkow, “Inequalities for the First-Fit chromatic number”, Journal of Graph Theory, vol. 59, no....
  • M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman, 1979.
  • C. Germain and H. Kheddouci, “Grundy coloring for power graphs”, Electronic Notes in Discrete Mathematics, vol. 15, pp. 65-67, 2004. https://doi.org/10.1016/S1571-0653(04)00533-5
  • N. Goyal and S. Vishvanathan, NP-completeness of undirected Grundy numbering and related problems. Manuscript, Bombay, 1997.
  • P. M. Grundy, “Mathematics and games”, Eureka, vol. 2, pp. 6-8, 1939.
  • A. Gyárfás and J. Lehel, “On-line and first-fit coloring of graphs”, Journal of Graph Theory, vol. 12, pp. 217-227, 1988. https://doi.org/10.1002/jgt.3190120212
  • F. Harary, Graph Theory. New Delhi: Narosa Publishing home, 1969.
  • K. Kaliraj, R. Sivakami and J. Vernold Vivin, “Star Edge Coloring of Corona Product of Path with Some Graphs”, International Journal of Mathematical...
  • K. Kaliraj, R. Sivakami and J. Vernold Vivin, “Star edge coloring of corona product of path and wheel graph families”, Proyecciones (Antofagasta),...
  • A. Mansouri and M.S. Bouhlel, “A Linear Algorithm for the Grundy Number of A Tree”, International Journal of Computer Science and Information...
  • C. Parks and J. Rhyne, Grundy Coloring for Chessboard Graphs. Seventh North Carolina Mini-Conference on Graph Theory, Combinatorics, and Computing,...
  • P. Sumathi and A. Rathi, “Quotient labeling of some ladder graphs”, American Journal of Engineering Research, vol. 7, no. 12, pp. 38-42, 2018.
  • J.A. Telle and A. Proskurowski, “Algorithms for Vertex Partitioning Problems on Partial k-Trees”, SIAM Journal on Discrete Mathematics, vol....
  • J. Vernold Vivin and K. Kaliraj, “On equitable coloring of corona of wheels”, Electronic Journal of Graph Theory and Applications, vol. 4,...
  • J. Vernold Vivin and M. Venkatachalam, “A Note on b-Coloring of Fan Graphs”, Journal of Discrete Mathematical Sciences and Cryptography, vol....
  • J. Vernold Vivin, Harmonious Coloring of total graph, n-leaf, central graphs and Circumdetic graphs. Bharathiyar University, Ph.D Thesis,...
  • M. Zaker, “Grundy chromatic number of the complement of bipartite graphs”, Australasian Journal of Combinatorics, vol. 31, pp. 325-329, 2005.