Distance r-Coloring and Distance r-Dominator Coloring number of a graph

G.Jothilakshmi; A.P.Pushpalatha; G.Sudhalakshmi; S.Suganthi; v.Swaminathan

doi:https://doi.org/10.14445/22315373/IJMTT-V5P505

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 5 | Number 2 | Year 2014 | Article Id. IJMTT-V5P505 | DOI : https://doi.org/10.14445/22315373/IJMTT-V5P505

Distance r-Coloring and Distance r-Dominator Coloring number of a graph

G.Jothilakshmi , A.P.Pushpalatha , G.Sudhalakshmi , S.Suganthi , v.Swaminathan

Abstract

Given a positive integer r, two vertices u,v V(G) are r-independent if d(u,v) > r. A partition of V(G) jnto r-independent set is called distance r-coloring . A study of distance r-coloring and distance r-dominator coloring concepts are studied in this paper.

Keywords

distance r-chromatic number, distance r-independent color partition , distance r-independent and distance r-dominator coloring.

References

[1] J.A. Andrews and M.S. Jacobson, On a generalization of chromatic number, Congr.Numer. 47 1985 pp. 33-48.
[2] R. Balakrishnan, S. Francis Raj and T. Kavaskar, Coloring the Mycielskian, Proceeding of International Conference – ICDM , 2008 pp 53-57.
[3] G. Chartrand, D. Geller and S. Hedetniemi, A generalization of chromatic number, Proc. Cambridge Philos. Soc. 64 (1968) 265-271.
[4] M.A. Henning, Distance Domination in Graphs:, Advance Topics (Eds: Teresa W. Haynes, Stephen T. Hedetniemi , Peter J. Slater) pp 321-349 , Marcel Dekker, Inc., New York 1997.
[5] G.Jothilakshmi, A.P.Pushpalatha, S.Suganthi and V.Swaminathan, (k,r)-coloring, International Journal of Mathematics, Computer science and Information Technology., Vol-I December 2008, 211-219.
[6] G.Jothilakshmi, Studies in Dominations in graphs with special reference to (k,r)-domination and weak convexity, Ph.D Thesis, Madurai Kamaraj University, 2009.
[7] Ralucca Michella Gera, On dominator coloring in graphs, Graph Theory Notes of New York LII, (2007) , 25-30.
[8] E.Sampathkumar and C.V.Venatachalam, Chromatic partitions of a graph, Discrete Math.74, 1989, 227-239
[9] E.Sampathkumar, Generalization of independence and chromatic numbers of a graph, Discrete Math. 115, 1993, pp. 246-251 .
[10] E.Sampathkumar and G.D. Kamath, k-Size Chromatic number of a graph, The Indian Journal of Statistics, Special Volume 54 (1992) pp. 393-397.

Citation :

G.Jothilakshmi , A.P.Pushpalatha , G.Sudhalakshmi , S.Suganthi , v.Swaminathan, "Distance r-Coloring and Distance r-Dominator Coloring number of a graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 5, no. 2, pp. 242-246, 2014. Crossref, https://doi.org/10.14445/22315373/IJMTT-V5P505