A Study of disjunctive total domination in claw-free graphs
碩士 === 國立東華大學 === 資訊工程學系 === 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. Disjunctive total dominating s...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
2015
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/60889029005038313770 |