Open Access   Article Go Back

Dom-chromatic Number of certain graphs

Usha. P1 , Joice Punitha. M.2 , Beulah Angeline E. F.3

Section:Research Paper, Product Type: Journal Paper
Volume-07 , Issue-05 , Page no. 198-202, Mar-2019

CrossRef-DOI:   https://doi.org/10.26438/ijcse/v7si5.198202

Online published on Mar 10, 2019

Copyright © Usha. P, Joice Punitha. M., Beulah Angeline E. F. . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Usha. P, Joice Punitha. M., Beulah Angeline E. F., “Dom-chromatic Number of certain graphs,” International Journal of Computer Sciences and Engineering, Vol.07, Issue.05, pp.198-202, 2019.

MLA Style Citation: Usha. P, Joice Punitha. M., Beulah Angeline E. F. "Dom-chromatic Number of certain graphs." International Journal of Computer Sciences and Engineering 07.05 (2019): 198-202.

APA Style Citation: Usha. P, Joice Punitha. M., Beulah Angeline E. F., (2019). Dom-chromatic Number of certain graphs. International Journal of Computer Sciences and Engineering, 07(05), 198-202.

BibTex Style Citation:
@article{P_2019,
author = {Usha. P, Joice Punitha. M., Beulah Angeline E. F.},
title = {Dom-chromatic Number of certain graphs},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {3 2019},
volume = {07},
Issue = {05},
month = {3},
year = {2019},
issn = {2347-2693},
pages = {198-202},
url = {https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=832},
doi = {https://doi.org/10.26438/ijcse/v7i5.198202}
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
DO = {https://doi.org/10.26438/ijcse/v7i5.198202}
UR - https://www.ijcseonline.org/full_spl_paper_view.php?paper_id=832
TI - Dom-chromatic Number of certain graphs
T2 - International Journal of Computer Sciences and Engineering
AU - Usha. P, Joice Punitha. M., Beulah Angeline E. F.
PY - 2019
DA - 2019/03/10
PB - IJCSE, Indore, INDIA
SP - 198-202
IS - 05
VL - 07
SN - 2347-2693
ER -

           

Abstract

For a given χ-coloring of a graph (V,E,ψ_G) , a dominating set S⊆V(G) is said to be dom-colouring set if it contains at least one vertex from each colour class of G. The dom-chromatic number is the minimal cardinality taken over all dom-colouring sets and is denoted by γ_dc (G). In this paper we have obtained the dom-chromatic number of various types of graphs like star graphs, windmill graphs, ladder graphs, comb graphs and for cycles.

Key-Words / Index Term

Dominating set, Dom-colouring set, Star graphs, Windmill graphs, Ladder graphs, Comb graphs

References

[1] C. Berge, “Theory of Graphs and its Applications”, Methuen, London, 1962.
[2] Ore. O, “Theory of Graphs”, American Mathematical Society Colloquium Publication 38 (American Mathematical Society Providence RI) 1962.
[3] T.W. Haynes, S.T. Hedetniemi and P.J. Slater, “Fundamentals of Domination in graphs,” Marcel Decker, Inc, New York 1997.
[4] B. Chaluvaraju, C. AppajiGowda, “The Neighbour Colouring Set in Graphs,” International Journal of Applied Mathematics and Computation, pp.301-311, 2012.
[5] T. R. Jensen and B. Toft, “Graph Coloring Problem,” John Wiley & Sons, Inc, New York 1995.
[6] E. Sampathkumar and G. D. Kamath, “A Generalization of Chromatic Index,” Discrete Mathematics 124, pp.173-177, 1994.
[7] T.W.Haynes, S.T.Hedetniemi, P.J. Slater, “Fundamentals of Domination in Graphs,” Marcel Dekker, New York, 1998.
[8] T.W.Haynes, S.T.Hedetniemi, P.J. Slater, “Domination in Graphs,” Advanced topics, Marcel Dekker, New York, 1998.
[9] H.B. Waliker, B.D. Acharya, E. Sampath Kumar, “Recent Devel-opments in the Theory of Domination in Graphs,” In:MRI Lecture Notes in Mathematics, Allahabad, The Mehta Research Institute of Mathematics and Mathematical Sciences, 1979.
[10] H. Hosoya, F.Harary, “On the Matching Properties of Three Fence Graphs,” Journal of Mathematical Chemistry, pp. 211-218, 1993.
[11] D. Frank Hsu, “Harmonious Labeling of Windmill Graphs and Related Graphs,” Spring, 1982.
[12] S. Sandhya, C. David Rai, C.Jayasekaran, “Some New Results on Harmonic Mean Graphs,” International Journal of Mathematics Archive, 2013