We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Strong Co-Secure Domination in Graphs.
- Authors
Thara, P.; Devi, B. Uma; Ambika, S. M.
- Abstract
Let G = (V, E) be a graph. A subset D of the vertex set V(G) of a graph G is a strong co-secure dominating set if every vertex v ∈ V - D there exists u ∈ D such that uv ∈ E(G) then D\{u} ∪ {v} and deg(u) ≥ deg(v). The strong co-secure domination number is the minimum cardinality of a strong co-secure dominating set of G, and it is denoted by yscsd (G). The strong co-secure dominating set of G is found for path, cycle, helm graph, closed helm graph, Petersen graph, gear graph, Tadpole graph, and Butterfly graph.
- Subjects
GRAPHIC methods; GEOMETRIC vertices; CARDINAL numbers; PETERSEN graphs; GRAPH theory
- Publication
Journal of Algebraic Statistics, 2022, Vol 13, Issue 3, p2614
- ISSN
1309-3452
- Publication type
Article