Graphs;
game chromatic number;
corona of two graphs;
D O I:
10.1016/j.akcej.2020.01.007
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this paper, we compute an upper bound for the game chromatic number of corona of any two simple graphs G and H, denoted by G degrees H. Also, we determine the game chromatic number of Pn degrees Pm,Pn degrees Cm,Pn degrees Ka,b,Pn degrees Wm,K1,m degrees Pn,Kn degrees Kn and Kn degrees Kn,n.