On the Complexity of Some Variations of Minus Domination and Signed Domination in Graphs
碩士 === 銘傳大學 === 資訊傳播工程學系碩士班 === 104 === A minus (respectively, signed) dominating function of a graph G = (V, E) is a function f：V → {-1, 0, 1} (respectively, {-1, 1}) such that Σu∈N_G[v] f(u) ≥ 1 for all v ∈ V , where N_G [v] = {v}⋃{u|(u, v) ∈ E}. The weight of a minus (respectively, signed) domina...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2016
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/40314646982330765238 |