Foolproof Weak Roman Domination Problem
碩士 === 國立嘉義大學 === 資訊工程學系研究所 === 103 === Abstract Given a graph G = (V,E) , a guard function f :V ®{0, 1, 2} of G decomposes the vertex set into 0 1 V , V , and 2 V such that { | ( ) } i V = v f v = i for 0 £ i £ 2 , and each 0 vÎV , 1 2 N(v)(V V ) ¹ Æ where N(v) ={u | uvÎE} . For a vertex 0 vÎV sati...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/31722270404352581676 |