On Classes Of Defensive Alliance Difference Secure Sets Of A Graph
Main Article Content
Abstract
For a graph , a defensive alliance of is a set of vertices satisfying the condition that for each , at least half of the vertices in the closed neighborhood of are in Let be a bijection. A subset is called difference secure set of with respect to if for all there is a such that if and only if . A defensive alliance of which is also a difference secure set is called defensive alliance difference secure set. In this paper, we compute the maximum cardinality of various types of minimal defensive alliance difference secure sets for paths.
Article Details
Issue
Section
Articles
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.