Some results on characterizing the edges
β
Laura A. Sanchis
π
Article
π
1995
π
Elsevier Science
π
English
β 821 KB
A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v β’ V-V' there exists some uβ’ V' for which {v,u} β’E. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu