Secure and Secure-dominating Set of Cartesian Product Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 99 === Let G=(V,E) be a graph, and S⊆ V(G). Defines P(S) is a power set of S, which is the set of all subsets of S. A function A : S→Ƥ (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 ? v . A function D...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/93034222312575649647 |