Restrained Global Defensive Alliances in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v17i3.5156Keywords:
Restrained domination, Defensive alliance, Global defensive alliance, Restrained global defensive allianceAbstract
A defensive alliance in a graph G is a nonempty set of vertices S ⊆ V (G) such that for every vertex v ∈ S, |N[v] ∩ S| ≥ |N(v) ∩ (V (G) ∖ S)|. A defensive alliance S is called global if every vertex in V (G) ∖ S is adjacent to at least one member of the alliance S. In this paper, the concept of restrained global defensive alliance in graphs was introduced. In particular, a global defensive alliance S is a restrained global defensive alliance if the induced subgraph of V ∖ S has no isolated vertex. Here, some properties of this alliance were identified, and its bounds were also determined. In addition, the restrained global defensive alliance number was also formulated, along with characterizations of some special classes of graphs, specifically complete, complete bipartite, and path graphs.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 European Journal of Pure and Applied Mathematics
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 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.