CFP last date
20 December 2024
Call for Paper
January Edition
IJCA solicits high quality original research papers for the upcoming January edition of the journal. The last date of research paper submission is 20 December 2024

Submit your paper
Know more
The week's pick
Responsive image
Improved Shuffled Frog Leaping Algorithm with Self-Adaptive Shuffling for Fuzzy Logic PD+G Controller Optimization in Robotic Manipulators

Duc Hoang Nguyen
Random Articles
Reseach Article

The Mediator Chromatic Number of Grid Graphs

by K.Thilagavathi, N. Roopesh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 5 - Number 6
Year of Publication: 2010
Authors: K.Thilagavathi, N. Roopesh
10.5120/920-1298

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 },
issue_date = { August 2010 },
volume = { 5 },
number = { 6 },
month = { August },
year = { 2010 },
issn = { 0975-8887 },
pages = { 9-11 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume5/number6/920-1298/ },
doi = { 10.5120/920-1298 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:53:31.937167+05:30
%A K.Thilagavathi
%A N. Roopesh
%T The Mediator Chromatic Number of Grid Graphs
%J International Journal of Computer Applications
%@ 0975-8887
%V 5
%N 6
%P 9-11
%D 2010
%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
  1. J. A Bondy and U.S.R. Murty, Graph theory with Applications. London: MacMillan (1976).
  2. Frank Harary and Stephen Hedetniemi, The Achromatic number of a graph. Journal of Combinatorial Theory, 8 (1970) 154-161.
  3. Frank Harary, Graph Theory. Narosa Publishing Home (1969).
  4. Frank Harary, Stephen Hedetniemi and Geert Prins An interpolation theorem for graphical homomorphisms. Portugaliae Mathematica, 26- Fasc.4 (1967).
  5. 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.
  6. Gary Chartrand and Ping Zhang Chromatic graph theory. CRC Press (2009).
  7. N. Roopesh and K. Thilagavathi, Mediator colouring of graphs . Far East Journal of Applied Mathematics,(submitted).
  8. N. Roopesh and K. Thilagavathi, Relation between Harmonious colouring and Mediator colouring. Applied Mathematics E-Notes, (communicated)
  9. 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.
  10. 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

Keywords

Mediator colourclass mediator colouring mediator chromatic number

Powered by PhDFocusTM