1. Secure domination for some special graphs.
- Author
-
Sangeetha, S. and Kaviya, G.
- Subjects
GRAPH theory ,DOMINATING set ,MATHEMATICS - 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. [ABSTRACT FROM AUTHOR]- Published
- 2022
- Full Text
- View/download PDF