Reserved Domination Number of some Graphs
Main Article Content
Abstract
In this paper the definitions of Reserved domination number and 2-reserved domination number are introduced as for the graph a subset of is called a Reserved Dominating Set of if (i)be any nonempty proper subset of ; (ii) Every vertex in is adjacent to a vertex in. The dominating set is called a minimal reserved dominating set if no proper subset of containing is a dominating set. The set is called Reserved set. The minimum cardinality of a reserved dominating set of is called the reserved domination number ofand is denoted by where is the number of reserved vertices. Using these definitions the 2-reserved domination number for Path graph , Cycle graph , Wheel graph , Star graph , Fan graph , Complete graph and Complete Bipartite graph are found.
Article Details
Issue
Section
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.