Dom-Color Number of a Graph

A.Muthukamatchi

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 44 | Number 4 | Year 2017 | Article Id. IJMTT-V44P536 | DOI : https://doi.org/10.14445/22315373/IJMTT-V44P536

Dom-Color Number of a Graph

A.Muthukamatchi

Citation :

A.Muthukamatchi, "Dom-Color Number of a Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 44, no. 4, pp. 260-262, 2017. Crossref, https://doi.org/10.14445/22315373/IJMTT-V44P536

Abstract

Let G be a graph with χ(G) = k.then G is called k-chromatic.In a coloring of G, the set of all vertices with a given color is called a color class. Let C = {V1,V2,...,Vk} be a k-coloring of G. Let dC denote the number of color classes in C which are dominating sets of G. Then dχ = max dC , where the maximum is taken over all k colorings of G , which we call the dom-color number of G. A partition of V into independent dominating sets of G is called an independent domatic partition of G or indomatic partition of G. A graph G which admits an independent domatic partition is called indominable. The maximum order of an independent domatic partition of G is called the indomatic number of G and is denoted by di(G). The chromatic bondage number ρ(G) is the minimum number of edges between two color classes in a k- coloring of G, where the minimum is taken over all k-colorings of G. We present several interesting results on dom-color number and chromatic bondage number .

Keywords

dom-color number , Chromatic bondage number, indomatic number

References

[1] G. Chartrand and L. Lesniak, Graphs and Digraphs, Fourth Edition, CRC Press, Boca Raton, 2004.
[2] E.J. Cockayne and S.T. Hedetniemi, Towards a theory of domination in graphs, Networks, 7(1977), 241 - 261.
[3] J.F.Fink,M.S.Jocobson,L.F.kinch and Roberts, The bondage number of A graph,DisceeteMath.,86(1990), 47-57
[4] F. Harary, Graph Theory, Addision - Wesley, Reading Mass,1972.
[5] F. Harary, Covering and packing in graphs I, Ann. N. Y. Acad. Sci., 175(1970), 198 - 205.
[6] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, Inc., New York, (1997).
[7] T. W. Haynes, S. T. Hedetniemi and P. J. Slater. Domination in Graphs - Advanced Topics, Marcel Dekker, Inc.,New York, (1997).
[8] P.J. Heawood, Map-colour theorem, Quart. J. Pure Appl.Math.,24 (1890), 332 - 338.
[9] A.B.Kempe, On the geographoical problem of four colors,Amer.J.Math.,2(1879),193-204.
[10] H.B. Walikar, B.D. Acharya and E. Sampathkumar, Recent Development in the theory of domination in graphs, In MRI Lecture Notes in Math., Mehta Research Instit., Allahabad,1, 1979.