Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

AN iP2 EXTENDED STAR GRAPH AND ITS HARMONIOUS CHROMATIC NUMBER

  • P. MANSOOR (Department of Mathematics, MES College of Engineering, Kuttippuram, Affiliated to APJ Abdul Kalam Technological University) ;
  • A. SADIQUALI (Department of Mathematical Sciences, MEA Engineering College, Perinthalmanna, Affiliated to APJ Abdul Kalam Technological University)
  • Received : 2022.09.01
  • Accepted : 2023.08.14
  • Published : 2023.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we introduce an iP2 extension of a star graph Sn for n ≥ 2 and 1 ≤ i ≤ n - 1. Certain general properties satisfied by order, size, domination (or Roman) numbers γ (or γR) of an iP2 extended star graph are studied. Finally, we study how the parameters such as chromatic number and harmonious chromatic number are affected when an iP2 extension process acts on the star graphs.

Keywords

Acknowledgement

The authors are thankful to the referee for the useful suggestions

References

  1. S. Balamurugan, P. Aristotle and V. Swaminathan, On Graphs whose Dom-chromatic and chromatic Strong Domination number is up to Four, International Journal of Pure and Applied Mathematics 119 (2018), 61-68. 
  2. F. Harary, Graph Theory, Addison Wesley, Reading Massachusetts, USA, 1969. 
  3. E.J. Cockayne, P.A. Dreyer Jr., S.M. Hedetniemi and S.T. Hedetniemi, Roman Domination in Graphs, Discrete Mathematics 278 (2004), 11-22.  https://doi.org/10.1016/j.disc.2003.06.004
  4. D. Gernert, Inequalities Between the Domination Number and the Chromatic Number of a Graph, Discrete Mathematics 76 (2004), 151-153.  https://doi.org/10.1016/0012-365X(89)90308-7
  5. O. Favaron, H. Karami, R. Khoeilar and S.M. Sheikholeslami, On the Roman Domination Number of a Graph, Discrete Mathematics 309 (2009), 3447-3451.  https://doi.org/10.1016/j.disc.2008.09.043
  6. J. Hopcroft and M.S.M. Krishnomoorthy, On the Harmonious Coloring of Graphs, SIAM Journal of Algebraic Discrete Methods 4 (1983), 306-311.  https://doi.org/10.1137/0604032
  7. Z. Miller and D. Pritikin, The harmonious coloring number of a graph, Discrete Math. 93 (1991), 211-228.  https://doi.org/10.1016/0012-365X(91)90257-3
  8. J. Mitchem, On the harmonious chromatic number of a graph, Discrete Math. 74 (1989), 151-157. https://doi.org/10.1016/0012-365X(89)90207-0