Inverse Domination on a Middle graph of some cycle related graphs
DOI:
https://doi.org/10.48047/qbh4fs54Keywords:
Domination, Inverse Domination, Middle GraphAbstract
Let G be non-trivial graph. A dominating set for a graph G is a subset D of its vertices,
such that any vertex of G is in D, or has a neighbor in D. The set S⊂ V(G)- D such that S
is a dominating set of G, then S is called an inverse dominating set with respect to D. The
minimum cardinality of an inverse dominating set is called an inverse dominating number
and is denoted by γ^' (G). In this paper we find inverse domination number on Middle
graph of some graphs.
Downloads
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.
