Title of article :
The Mediator Chromatic Number of Grid Graphs
Author/Authors :
N. Roopesh ، نويسنده , , K.Thilagavathi، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Abstract :
In this paper, we determine the mediator chromatic number of cartesian product of a path with K2 and thus prove that the mediator chromatic number of Ladder graphs and Grid graphs are polynomially solvable.
Keywords :
Mediator colourclass , mediator chromatic number , mediator colouring
Journal title :
International Journal of Computer Applications
Journal title :
International Journal of Computer Applications
