Zobrazeno 1 - 1
of 1
pro vyhledávání: '"吳升福"'
Autor:
Sheng-Fu Wu, 吳升福
103
Total dominating set is a subset D of V for a graph G = (V;E) such that every vertex is adjacent to at least one member of D. Total dominating number of a graph G, denoted by t(G), is the size of a minimum total dominating set of G. Disjunct
Total dominating set is a subset D of V for a graph G = (V;E) such that every vertex is adjacent to at least one member of D. Total dominating number of a graph G, denoted by t(G), is the size of a minimum total dominating set of G. Disjunct
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/60889029005038313770
