On the Pendant Regular Domination Number of a Graph

Authors

  • Ajithkumara Department of Mathematics, Vidyavardhaka College of Engineering (affiliated to Visvesvaraya Technological University), Mysuru 570 002, Karnataka, India https://orcid.org/0009-0006-5971-9660
  • Puttaswamy Department of Mathematics, P.E.S. College of Engineering (affiliated to Visvesvaraya Technological University), Mandya 571 401, Karnataka, India https://orcid.org/0000-0003-1830-3280
  • S. Puneeth Department of Advanced Computing, St. Joseph’s University, Bengaluru 560 027, Karnataka, India https://orcid.org/0000-0002-5532-696X

DOI:

https://doi.org/10.26713/cma.v16i3.3262

Keywords:

Domination number, Pendant regular domination, Graph operations

Abstract

This paper introduces and explores a novel domination parameter in graph theory, termed the pendant regular domination number. We initiate a foundational study by determining the exact values of this parameter for several standard and well-known graph families, including paths, cycles, stars, and complete graphs. In addition, few fundamental bounds are deduced and the behavior of the pendant regular domination number is examined under various graph operations such as the corona, join, and Cartesian product.

Downloads

Download data is not yet available.

References

C. Berge, Theory of Graphs and Its Applications, Methuen, London, UK (1962).

L. R. Bindu, P. Titus and D. Dhanya, Clustered wireless sensor network in precision agriculture via graph theory, Intelligent Automation & Soft Computing 36(2) (2023), 1435 – 1449, DOI: 10.32604/iasc.2023.030591.

S. Bouamama and C. Blum, An improved greedy heuristic for the minimum positive influence dominating set problem in social networks, Algorithms 14(3) (2021), 79, DOI: 10.3390/a14030079.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, Bell Telephone Laboratories, Inc., x + 338 pages (1979), URL: https://perso.limos.fr/~palafour/PAPERS/PDF/Garey-Johnson79.pdf.

F. Harary, Graph Theory, Addison-Wesley Publishing Company, Reading, Massachusetts, ix + 274 pages (1969).

T. W. Haynes, S. Hedetniemi and P. Slater, Fundamentals of Domination in Graphs, 1st edition, CRC Press, Boca Raton, 464 pages (1998), DOI: 10.1201/9781482246582.

R. M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations, Springer, Boston, MA (1972), DOI: 10.1007/978-1-4684-2001-2_9.

J. Leskovec, L. A. Adamic and B. A. Huberman, The dynamics of viral marketing, ACM Transactions on the Web 1(1) (2007), 5 pages, DOI: 10.1145/1232722.1232727.

S. S. Mahde and V. Mathad, Domination integrity of line splitting graph and central graph of path, cycle and star graphs, Applications and Applied Mathematics: An International Journal 11(1) (2016), Article 28, URL: https://digitalcommons.pvamu.edu/aam/vol11/iss1/28.

V. Mathad and S. S. Mahde, The minimum hub distance energy of a graph, International Journal of Computer Applications 125(13) (2015), 1 – 6, DOI: 10.5120/ijca2015906179.

S. R. Nayaka, S. Purushothama and Puttaswamy, Pendant domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 112 (2020), 219 – 229, URL: https://combinatorialpress.com/jcmcc-articles/volume-112/pendant-domination-in-graphs/.

O. Ore, Theory of Graphs, American Mathematical Society Colloquium Publications, Vol. 38, American Mathematical Society, Providence, RI (1962).

S. Raghavan and R. Zhang, Rapid influence maximization on social networks: The positive influence dominating set problem, INFORMS Journal on Computing 34(3) (2022), 1345 – 1365, DOI: 10.1287/ijoc.2021.1144.

J. Rani and S. Mehra, The regular domination number of some special graphs, Communications in Mathematics and Applications 15(1) (2024), 161 – 178, DOI: 10.26713/cma.v15i1.2393.

A. Sahal and V. Mathad, Two-out degree equitable domination in graphs, Transactions on Combinatorics 2(3) (2013), 13 – 19, DOI: 10.22108/toc.2013.3018.

N. R. Sivakumar, S. M. Nagarajan, G. G. Devarajan, L. Pullagura and R. P. Mahapatra, Enhancing network lifespan in wireless sensor networks using deep learning based Graph Neural Network, Physical Communication 59 (2023), 102076, DOI: 10.1016/j.phycom.2023.102076.

Downloads

Published

30-10-2025
CITATION

How to Cite

Ajithkumara, Puttaswamy, & Puneeth, S. (2025). On the Pendant Regular Domination Number of a Graph. Communications in Mathematics and Applications, 16(3), 869–877. https://doi.org/10.26713/cma.v16i3.3262

Issue

Vol. 16 No. 3 (2025)

Section

Research Article

License

Creative Commons Licence 4.0 by  

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.