Twain Secure Perfect Dominating Sets of Tadpole (T_(n,1)) Graphs

Authors

  • K. Lal Gipson, C. Vinisha

Keywords:

tadpole (T_(n,1)), twain secure perfect dominating set, twain secure perfect domination number.

Abstract

Let  be a simple graph.  A set   is a dominating set of  if  every vertex in  is adjacent to a vertex in   A subset  of  is called a twain secure perfect dominating set of  (TSPD- set)  if  every vertex  is adjacent to exactly one vertex  and  is a dominating set of G.  The minimum cardinality of a twain secure perfect dominating set of  is called the twain secure perfect domination number of  and is denoted by   Let  be the family of all twain secure perfect dominating sets of  with cardinality  for   In this paper, we construct all the twain secure perfect dominating sets of tadpole graphs  by recursive method.

Downloads

Download data is not yet available.

References

S. Alikhani and Y.H. Peng (2009), Dominating Sets and Domination Polynomials of Paths, International Journal of Mathematics and Mathematical Sciences, vol. 2009, article ID 542040.

F. Buckley and F. Harary (1990), Distance in Graphs, Addition-Wesley, Redwood City, California.

E.J. Cockayne, P.J.P. Grobler, W.R. Grundlingh, J. Mungannga, and J.H. Van Vuuren (2005), Protection of a Graph, Utilitas Mathematica, vol. 67, pp. 19 − 32.

K. Lal Gipson and S. Arun Williams (2021), 2− Edge Dominating Sets and 2−Edge Domination Polynomials of Paths, Malaya Journal of Mathematik, vol. 9, pp. 844 − 849.

K. Lal Gipson and S. Arun Williams, 2− Edge Dominating Sets and 2−Edge Domination Polynomials of tadpole (T_(n,1)), International virtual conference on recent trends and techniques in Mathematical and Computer Science, pp. 18-30.

K. Lal Gipson and T. Subha (2022), Secure Dominating Sets of Wheels, IOSR Journal of Mathematics (IOSR-JM), vol. 18, no. 1, pp. 21 − 26.

K. Lal Gipson and T. Subha (2020), Secure Domination Polynomials of Paths, International Journal of Scientific & Technology Research, vol. 9, no. 2, pp. 6517 − 6521.

Vijayan and K. Lal Gipson (2012), Dominating Sets and Domination Polynomials in Square of Cycles, IOSR Journal of Mathematics (IOSR-JM), vol. 3, no. 4, pp. 04 − 14.

Vijayan and K. Lal Gipson (2013), Dominating Sets and Domination Polynomials in Square of Paths, Open Journal in Discrete Mathematics, vol. 3, pp. 60 – 69.

P.M. Weichsel (1994), Dominating Sets in n-cubes, Journal of Graph Theory, vol. 18, no. 5, pp. 479 − 488.

Downloads

Published

13.07.2024

How to Cite

K. Lal Gipson. (2024). Twain Secure Perfect Dominating Sets of Tadpole (T_(n,1)) Graphs. International Journal of Intelligent Systems and Applications in Engineering, 12(22s), 2210–2216. Retrieved from https://ijisae.org/index.php/IJISAE/article/view/7752

Issue

Vol. 12 No. 22s (2024)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.

IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.