The study of secure-dominating set of graph products
碩士 === 國立高雄師範大學 === 數學系 === 102 === If G is a graph and v is a vertex of G, then NG(v) denotes the neighborhood of v in G and NG[v] denotes the closed neighborhood of v in G. Given a subset S of V (G), a function A defined on S is called an attack on S in G if A(u) ⊆ NG(u) − S for any u ∈ S and A(u)...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/75233884100467184469 |