Dominant clusters of increasing n-corona product graph

Esther, S. Jebisha; Vivik, J. Veninstine

doi:10.47974/JDMSC-2068

Open Access Research Article

Dominant clusters of increasing n-corona product graph

^*S. Jebisha EstherCorresponding authorjebishaesther@gmail.comDepartment of Mathematics Division Karunya Institute of Technology and SciencesCoimbatore, Tamil Nadu, 641114, India0000-0002-8005-755View full profile → , J. Veninstine Vivikvivikjose@gmail.comDepartment of Mathematics Division Karunya Institute of Technology and SciencesCoimbatore, Tamil Nadu, 641114, India0000-0003-3192-003XView full profile →

* Corresponding author · click or hover a name for details

pp. 2737–2749Vol. 28Issue 7October 2025DOI: 10.47974/JDMSC-2068 Crossmark XML

Received:: 05 Dec 2023
Published Online:: 12 Jul 2025
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2068
Pages:: 2737–2749

Abstract

The streamlining of dominating clusters from the family of product graphs can be well organized using graph domination. A minimal dominating set D comprises the lowest possible integer of graph vertices, where alternative graph vertices are connected with at least one minimal dominating set. The Increasing Corona Product (ICP) of order one for Kn and family of prisms are modelled and their domination number g(G), dominating generation number gg, dominating cluster number gz(G) and split domination gs(G) number are obtained in this research work.

Keywords

Domination number Dominance generation number Dominant clusters Split domination number Corona product

Subject Classifications

05C6905C76

References

[1] A. Alameri, “F-coindex of some corona products of graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 26, no. 1, pp. 175-190 (2021).
[2] C. Berge, The Theory of Graphs, Dover Publications (2013).
[3] C. Jaisunder, I. Ahmad, and R. K. Mishra, “Effect of component-based search for phonetic matching on Indian names,” Online International Interdisciplinary Research Journal, vol. 7, no. 4, pp. 70-79 (2007).
[4] E. J. Cockayne and S. T. Hedetniemi, “Towards a theory of domination in graphs,” Networks, vol. 7, no. 3, pp. 247-261 (1977).
[5] R. S. Durai, S. G. Shiji Kumari, and A. M. Anto, “Certified domination number in corona product of graphs,” Malaya Journal of Matematik, vol. 9, no. 1, pp. 1080-1082 (2021).
[6] R. Frucht and F. Harary, “On the corona of two graphs,” Aequationes Mathematicae, vol. 4, pp. 322-325 (1970).
[7] W. Goddard and M. A. Henning, “A note on domination and total domination in prisms,” Journal of Combinatorial Optimization, vol. 35, no. 1
[8] Gupta and Preeti, “Domination in graph with application,” Indian Journal of Research, vol. 2, no. 3, pp. 115–117 (2013).
[9] I. A. Mohamed and B. H. Sabitha, “Accurate split (non-split) domination in fuzzy graphs,” Advances and Applications in Mathematical Sciences, vol. 20, no. 5, pp. 839–851 (2021).
[10] V. R. Kulli and J. Bidarahall, “The split domination number of a graph,” Graph theory notes of New York, vol. 32, no. 3, pp. 16–19 (1997).
[11] M. Mullai, S. Broumi, J. R. Jeyabalan, and R. Meenakshi, “Split domination in neutrosophic graphs,” Neutrosophic Sets and Systems, vol. 47, no. 1, pp. 16 (2021).
[12] N. N. Swamy, B. S. Sooryanarayana, and G. K. Nanjunda Swamy, “Open neighborhood chromatic number of an antiprism graph,” Applied Mathematics E-Notes, vol. 15, pp. 54–62 (2015).
[13] R. I. R. Iyer and K. S. Sundaram, “Irregular colorings of certain classes of corona product and Sierpiński graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 1, pp. 97-105 (2022).
[14] R. M. E. Raja and B. Praisy, “Split domination decomposition of path graphs,” Ratio Mathematica, vol. 44, pp. 175–181 (2022).
[15] D. Resty and A. N. M. Salman, “The rainbow connection number of an n-crossed prism graph and its corona product with a trivial graph,” Procedia Computer Science, vol. 74, pp. 143–150 (2015).
[16] K. V. Suryanarayana Rao and V. Sreeenivasan, “The split domination in arithmetic graphs,” International Journal of Computer Applications, vol. 29, no. 3, pp. 46–49 (2011).
[17] R. Sundara Rajan, K. Jagadeesh Kumar, A. Shantrinal, T. M. Rajalaxmi, I. Rajasingh, and K. Balasubramanian, “Biochemical and phylogenetic networks-I: hypertrees and corona products,” Journal of Mathematical Chemistry, vol. 59, pp. 676–698 (2021).
[18] M. Tavakoli, F. Rahbarnia, and A. Reza Ashrafi, “Studying the corona product of graphs under some graph invariants,” Transactions on Combinatorics, vol. 3, no. 3, pp. 43–49 (2014).
[19] V. J. Veninstine, “Energy and basic reproduction number of n-Corona graphs prior to order 1,” Proyecciones (Antofagasta), vol. 41, no. 4, pp. 835–854 (2022).
[20] M. Goudar, K. C. Rajendra Prasad, and N. K. M. Venkanagouda, “Split domination number in edge semi-middle graph,” Pan-American Journal of Mathematics, vol. 1, pp. 13 (2022).
[21] D. A. R. Wardani, D. Dafik, I. H. Agustin, R. Nisviasari, and E. Y. Kurniawati, “The locating dominating set (LDS) of generalized corona product of path graph and any graphs,” Journal of Physics: Conference Series, vol. 1465, no. 1, pp. 012028 (2020).

Views: 122Downloads: 8Citations: 0