Total Safe Domination on Some Known Families of Graphs

Authors

  • Wendel Glenn Jumalon Department of Mathematics, College of Arts and Sciences, Central Mindanao University, Musuan, Maramag, Bukidnon, 8714 Philippines
  • Isagani Cabahug Department of Mathematics, College of Arts and Sciences, Central Mindanao University, Musuan, Maramag, Bukidnon, 8714 Philippines

DOI:

https://doi.org/10.29020/nybg.ejpam.v18i2.5917

Keywords:

Total domination, Safe Set , Safe Domination, Total Safe Domination

Abstract

Let G = (V (G),E(G)) be a connected simple graph. A total dominating set in G is a nonempty set S ⊆ V (G) such that every vertex v ∈ V (G) is adjacent to at least one vertex in S. A safe dominating set in G is a nonempty set S ⊆ V (G) which is a dominating set such that every component of G[S] is at least as large as any adjacent component of G[V (G) ∖ S]. This study introduces the concept of total safe domination in graphs, a combination of total domination and safe domination in graphs. Total safe domination ensures that no vertex in the dominating set is isolated and that every component of the subgraph induced by the set is robust, with respect to the adjacent components in the induced subgraph of the complement set. This guarantees both coverage and structural resilience. This paper presents the characterization of total safe dominating sets on some known graph families, namely: path, cycle, complete, sunlet, friendship, and helm graphs. It also determines the total safe domination number of the mentioned graphs.

Downloads

Published

2025-05-01

Issue

Vol. 18 No. 2: (April 2025)

Section

Discrete Mathematics

License

Copyright (c) 2025 Wendel Glenn Jumalon, Isagani Cabahug

Creative Commons License

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

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

How to Cite

Total Safe Domination on Some Known Families of Graphs. (2025). European Journal of Pure and Applied Mathematics, 18(2), 5917. https://doi.org/10.29020/nybg.ejpam.v18i2.5917