Author:
Stella Maragatham R.,Subramanian A.
Abstract
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.
Publisher
Universidad Catolica del Norte - Chile
Reference23 articles.
1. [1] C. Berge, Graphs and Hypergraphs. North Holland, 1973.
2. [2] Y. Caro, A. Sebö and M. Tarsi, "Recognizing greedy structures", Journal of Algorithms, vol. 20, no. 1, pp. 137-156, 1996. doi: 10.1006/jagm.1996.0006
3. [3] C.A. Christen and S.M. Selkow, "Some perfect coloring properties of graphs", Journal of Combinatorial Theory, Series B, vol. 27, no. 1, pp. 49-59, 1979. doi: 10.1016/0095-8956(79)90067-4
4. [4] 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 Combinatorial Mathematics and Combinatorial Computing, vol. 33, pp. 257-273, 2000.
5. [5] 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, vol. 11, pp. 157-159, 1987.