Research Article

The Mediator Chromatic Number of Grid Graphs

by  K.Thilagavathi, N. Roopesh
journal cover
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 5 - Issue 6
Published: August 2010
Authors: K.Thilagavathi, N. Roopesh
10.5120/920-1298
PDF

K.Thilagavathi, N. Roopesh . The Mediator Chromatic Number of Grid Graphs. International Journal of Computer Applications. 5, 6 (August 2010), 9-11. DOI=10.5120/920-1298

                        @article{ 10.5120/920-1298,
                        author  = { K.Thilagavathi,N. Roopesh },
                        title   = { The Mediator Chromatic Number of Grid Graphs },
                        journal = { International Journal of Computer Applications },
                        year    = { 2010 },
                        volume  = { 5 },
                        number  = { 6 },
                        pages   = { 9-11 },
                        doi     = { 10.5120/920-1298 },
                        publisher = { Foundation of Computer Science (FCS), NY, USA }
                        }
                        %0 Journal Article
                        %D 2010
                        %A K.Thilagavathi
                        %A N. Roopesh
                        %T The Mediator Chromatic Number of Grid Graphs%T 
                        %J International Journal of Computer Applications
                        %V 5
                        %N 6
                        %P 9-11
                        %R 10.5120/920-1298
                        %I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we determine the mediator chromatic number of cartesian product of a path with K_2 and thus prove that the mediator chromatic number of Ladder graphs and Grid graphs are polynomially solvable.

References
  • J. A Bondy and U.S.R. Murty, Graph theory with Applications. London: MacMillan (1976).
  • Frank Harary and Stephen Hedetniemi, The Achromatic number of a graph. Journal of Combinatorial Theory, 8 (1970) 154-161.
  • Frank Harary, Graph Theory. Narosa Publishing Home (1969).
  • Frank Harary, Stephen Hedetniemi and Geert Prins An interpolation theorem for graphical homomorphisms. Portugaliae Mathematica, 26- Fasc.4 (1967).
  • M. Farber, G. Hahn, P. Hell and D. J Miller Concerning the achromatic number of graphs . J. Combinatorial Theory, Ser. B, 40 (1986) 21-39.
  • Gary Chartrand and Ping Zhang Chromatic graph theory. CRC Press (2009).
  • N. Roopesh and K. Thilagavathi, Mediator colouring of graphs . Far East Journal of Applied Mathematics,(submitted).
  • N. Roopesh and K. Thilagavathi, Relation between Harmonious colouring and Mediator colouring. Applied Mathematics E-Notes, (communicated)
  • N. Roopesh and K. Thilagavathi, Mediator colouring of certain product of a path with K_2 . Proceedings of the International Conference on Mathematics and Computer Science (ICMCS) (2010), 115-118.
  • Yukio Shibata and Yosuke Kikuchi, Graph products based on the distance in graphs. IEICE Trans. Fundamentals, E83-A. No.3 (March 2000) 459-464.
Index Terms
Computer Science
Information Sciences
No index terms available.
Keywords

Mediator colourclass mediator colouring mediator chromatic number

Powered by PhDFocusTM