Domination Parameter of Book Graph Bm

B. N. Kavitha; C. S. Nagabhushana

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

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 69 | Issue 1 | Year 2023 | Article Id. IJMTT-V69I1P513 | DOI : https://doi.org/10.14445/22315373/IJMTT-V69I1P513

Domination Parameter of Book Graph Bm

B. N. Kavitha, C. S. Nagabhushana

Received	Revised	Accepted	Published
09 Dec 2022	10 Jan 2023	21 Jan 2023	31 Jan 2023

Citation :

B. N. Kavitha, C. S. Nagabhushana, "Domination Parameter of Book Graph Bm," International Journal of Mathematics Trends and Technology (IJMTT), vol. 69, no. 1, pp. 86-90, 2023. Crossref, https://doi.org/10.14445/22315373/IJMTT-V69I1P513

Abstract

In this paper, we present results on various domination parameters like domination, split domination, perfect domination, connected domination, equitable domination, inverse domination, restrained domination, and strong domination number for the product of the start graph with path P2 namely Bm

Keywords

Book Graph Bm, Domination parameters.

References

[1] E. J. Cockayne et al., “Perfect Domination in Graphs,” Journal of Combinatorics, Information and System Sciences, vol. 1, no. 8, pp. 136-148, 1993.
[2] E. J. Cockayne, “Domination of Undirected Graphs-A Survey,” Theory and Applications of Graphs, pp. 141-147, 1978. Crossref, https://doi.org/10.1007/BFb0070371
[3] G. S. Domke et al., “Restrained Domination in Graphs,” Discrete Mathematics, vol. 203, no. 1-3, pp. 61-69, 1999. Crossref, https://doi.org/10.1016/S0012-365X(99)00016-3
[4] Nandi M, Parui S and A. Adhikari, “The Domination Numbers of Cylindrical Grid Graphs,” Applied Mathematics and Computation, vol. 217, no. 10, pp. 4879-4889, 2011. Crossref, https://doi.org/10.1016/j.amc.2010.11.019
[5] S. K. Vaidya, and S. H. Karkar, “On Strong Domination Number of Graphs,” Applications and Applied Mathematics: An International Journal, vol. 12, no. 1, pp. 604-612, 2017.
[6] B. N. Kavitha, and Indrani Kelkar, “Equitable Domination to the Cross Product of Special Graph,” International Journal of Science Technology & Engineering, vol. 3, no. 10, 2017.
[7] B. N. Kavitha, and Indrani Kelkar, “Split and Equitable Domination in Book Graph and Stacked Book Graph,” International Journal of Advanced Research in Computer Science, vol. 8, no. 6, pp. 108-112, 2017. Crossref, https://doi.org/10.26483/ijarcs.v8i6.4475
[8] B. N. Kavitha, Indrani Kelkar, and K. R. Rajanna, “Perfect Domination in Book Graph and Stacked Book Graph,” International, Journal of Mathematics, Trends and Technology, vol. 56, no. 7, pp. 511-514, 2018. Crossref, https://doi.org/10.14445/22315373/IJMTT-V56P564
[9] B. N. Kavitha, and Indrani Kelkar, “Hinge Domination Number of a Graph,” International Journal of Engineering Research and Application, vol. 8, no. 7, pp. 70-71, 2018. Crossref, https://doi.org/10.9790/9622-0807027071
[10] B. N. Kavitha, and Indrani Kelkar, “Hinge Domination of Cross Product Special Graph,” International Journal of Engineering Research and Application. vol. 10, no. 7, pp. 20-23, 2020. Crossref, https://doi.org/10.9790/9622-1007012023
[11] B. N. Kavitha, and Indrani Kelkar, “Zagreb Indices of Book Graph and Stacked Book Graph,” International Journal of Engineering, Science and Mathematics, vol. 9, no. 6, pp. 25-39, 2020.
[12] B. N. Kavitha, Indrani Pramod Kelkar, and K. R. Rajanna, “Vulnerability Parameter of Book Graph,” International Journal of Mathematics Trends and Technology, vol. 66, no. 5, 2020. Crossref, https://doi.org/10.14445/22315373/IJMTT-V66I5P501
[13] B. N. Kavitha, C. S. Nagabhushana, and K. Rashmi, “Domination Zagreb Indices of a Book Graph and Stacked Book Graph,” International Journal of Mathematical Trends and Technology, vol. 68, no. 5, pp. 17-21, 2022. Crossref, https://doi.org/10.14445/22315373/IJMTT-V68I5P504
[14] B. N. Kavitha, K. Srinivasa Rao, and C. S. Nagabhushana, “Some Degree-based Connectivity Indices of Tadpole Graph,” International Journal of Recent Technology and Engineering, vol. 8, no. 2S6, 2019. Crossref, https://doi.org/10.35940/ijrte.B1094.0782S619
[15] B. N. Kavitha, C. S. Nagabhushana, and K. S. Onkarappa, “Zagreb Indices of Lollipop Graph,” International Journal of Creative Research Thought, vol. 11, no. 1, p. 1, 2023.
[16] Kulli, and Janakiram, “The Split Domination Number of a Graph,” Graph Theory Notes of New York XXXII, pp. 16-19, 1997.
[17] V. R. Kulli, and S. C. Sigarkanti, “Inverse Domination in Graphs,” National Academy Science Letters, vol. 14, no. 12, pp. 473-475, 1991.
[18] J.H. Hattingh and R.C. Laskar, On weak domination in graphs, Manuscript.Google Scholar
[19] E. Sampathkumar, and H. B. Walikar, “The Connected Domination Number of a Graph,” Journal of Mathematical and Physical Sciences, vol. 13, no. 6, pp. 607-613, 1979.
[20] R. Todeschini, and V. Consonni, “Molecular Descriptors for Chemoinformatics,” Wiley, 2009.
[21] V. G. Vizing, “The Cartesian product of graphs, Vycisl, Equitable Domination on Graphs,” Kragujevac Journal of Mathematics, vol. 35, no. 1, pp. 191-197, 2011.
[22] V. Swaminathan, and K. M. Dharmalingam, “Degree Equitable Domination on Graphs,” Kragujevac Journal of Mathematics, vol. 35, no, 1, pp. 191-197, 2011.
[23] H. B. Walker, B. D. Acharya, and E. Sampathkumar, “Recent Developments in the Theory of Domination in Graphs,” MRI Lecture Notes in Math, Mehta Research Institute of Mathematics, vol. 1, 1979.
[24] Stacked Book Graph website, 2022. [Online]. Available: https://mathworld.wolfram.com/search/?q=Stacked+Book+Graph