Abstract
Graph theory is a branch of mathematics which is quit rich and interesting. The study of domination is one of the fastest growing area in graph. There are different types of domination such as connected domination, independent domination, total domination, paired domination, secure domination , etc. “The secure dominating set S of a graph G is a dominating set with the property that each vertex u∈V\ S is adjacent to a vertex v∈S such that (S\ v) Uu is a dominating set. The minimum cardinality of such a set is called the secure domination number and denoted by γs(G)”. In this paper we discuss about the secure domination for some special graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
