Strongly Isolate Perfect Domination in Graphs
DOI:
https://doi.org/10.63278/1480Keywords:
Domination, isolate domination, strongly isolate perfect domination.Abstract
A dominating set of a graph is said to be an isolate dominating set (IDS) if < > has at least one isolated vertex. The ID number of is represented by . An ID-set is considered as strongly isolate dominating set (SIDS) if there exists a ∈ such that , where and . A dominating set is called a perfect dominating set if every vertex in V (G) − has exactly one neighbour in . By using the above concept and the definition of SID, we define a new concept called ”Strongly Isolate Perfect Domination”(SIPD). An isolate dominating set is said to be strongly isolate perfect dominating set if there exists such that and is a perfect dominating set of . This paper involves some basic features of SIPDS and compare SIPDS with dominating set, ID-set and efficient dominating set (EDS). At the end, includes SIPD number of path, cycle, complete bi- partite graph, complete b- partite graph and some group of graphs.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Sivagnanam Mutharasu, Sandhya S

This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their published articles online (e.g., in institutional repositories or on their website, social networks like ResearchGate or Academia), as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

Except where otherwise noted, the content on this site is licensed under a Creative Commons Attribution 4.0 International License.



According to the