<![CDATA[Coloring vertices on graph is one of the topics of discrete mathematics that are still developing until now. Exploration Coloring vertices develops in the form of a game known as a coloring game. Let G graph. The smallest number k such that the graph G can be colored in a coloring game is called game chromatic number. Notated as χ_g (G). The main objective of this research is to prove game chromatic numbers from graphsThis study examines and proves game chromatic numbers from graphs shack(K_n,v_i,t),shack(S_n,v_i,t), and shack(K_(n,n),v_i,t). The research method used in this research is qualitative. The result show that χ_g (shack(K_n,v_i,t))=n,and χ_g (shack(S_n,v_i,t))=χ_g (shack(K_(n,n),v_i,t))=3. The game chromatic number of the shackle graph depends on the subgraph and linkage vertices. Therefore, it is necessary to make sure the vertex linkage is colored first.]]>
Copyrights © 2021
