On The Total Domination and Connected Total Domination Sets of G_(p,q)^M GRAPH

Authors

  • K.Sravanthi Department of Applied Mathematics, Sri Padmavati Mahila Visvavidyalayam, Tirupati, Andhra Pradesh, India. Author
  • M. Siva Parvathi Department of Applied Mathematics, Sri Padmavati Mahila Visvavidyalayam, Tirupati, Andhra Pradesh, India Author
  • K.Manjula Department of Applied Mathematics, Sri Padmavati Mahila Visvavidyalayam, Tirupati, Andhra Pradesh, India Author

Keywords:

Dominating sets, Total Dominating sets, connected total domination sets, total domination number and connected total Domination number, G_(p,q)^Mgraph.

Abstract

In graph theory, the theory of domination has several applications in various fields of science and technology, which is considered as a turn up field of research. In real life, it is extremely important in fields like network design, wireless sensor networks, logistics,mobile computing, telecommunication and others. Problems with facility location, communication or electrical network monitoring can lead to dominance. Undirected graphs is one of the most excellent models in connection with distributed computation and parallel processing. A set  is said to be a dominating set of the graph  if every vertex in  is adjacent to at least one vertex in  The domination number  of the graph  is the minimum cardinality of a dominating set of In this paper, some results on total dominating sets and connected total dominating sets of  graph on a finite subset of natural numbers are presented and the domination numbers are obtained for various values of p, q

References

Berge, C. (1962). The theory of graphs and its applications. Methuen.

Ore, O. (1962). Theory of graphs. American Mathematical Society.

Chakrabarty, I., Kureethara, J. V., & Acharya, M. (2021). The G_(mⓜ,n)^Mgraph on a finite subset of natural numbers. Proceedings of the Indian Academy of Mathematics, 10(1), 45–59.

Bollobás, B. (1998). Modern graph theory. Springer.

Cockayne, C. J., Dawes, R. M., & Hedetniemi, S. T. (1980). Total domination in graphs. Networks, 10, 211–219.

Budden, F. (1985). Cayley graphs for some well-known groups. The Mathematical Gazette, 69, 271–278.

Haynes, T. W., Hedetniemi, S. T., & Slater, P. J. (1998). Fundamentals of domination in graphs. Marcel Dekker.

Downloads

Published

01-01-2026

How to Cite

On The Total Domination and Connected Total Domination Sets of G_(p,q)^M GRAPH. (2026). GAMANAM: Global Advances in Multidisciplinary Applications in Next-Gen And Modern Technologies, 2(1), 8-11. https://gamanamspmvv.in/index.php/gamanams/article/view/59