HIGHLIGHTS
- who: Upper k-tuple domination and colleagues from the Department of Mathematics, National Taiwan University, Taipei, Taiwan have published the research work: Upper k -tuple domination in graphs, in the Journal: (JOURNAL)
- what: The authors show that the upper k-tuple domination problem is NP-complete for bipartite graphs and chordal graphs.
SUMMARY
G. J. Chang, P. Dorbec, H. K. Kim, A. Raspaud, H. Wang, W. Zhao (respectively, are adjacent). For a k-tuple dominating set S, any vertex in N ∩ S is said to dominate v. Notice that a graph . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.