DETOUR CERTIFIED DOMINATION NUMBER OF GRAPHS
Main Article Content
Abstract
In this paper, we introduce the concept of detour certified domination number of Graphs. Here we characterised graphs with and studied the relation of with other parameters. A subset S of V(G) is said to be a certified dominating set if it is a dominating set and every vertex of S has either zero or atleast two neighbours in V(G) – S. The certified domination number is the minimum cardinality of the certified dominating set and is denoted by . A set S of vertices of G is called a detour certified dominating set if S is a certified dominating set and every vertex of G lie in some detour of vertices of S. The minimum cardinality of a detour certified dominating set is the detour certified domination number of G and is denoted by
Downloads
Metrics
Article Details
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.
