Secure and secure-dominating sets of graphs
碩士 === 國立東華大學 === 應用數學系 === 97 === Given a graph G and a set S ⊆ V (G), a function A : S → P(V (G) − S) is called an attack on S (in G) if A(u) ⊆ N (u)−S for all u ∈ S and A(u)∩A(v) = ∅ for all u, v ∈ S, u 6= v. And a function D : S → P(S) is called a defense of S if D(u) ⊆ N [u] ∩ S for all u ∈ S a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/07842213271087974505 |