Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference30 articles.
1. Total domination in graphs;Cockayne;Networks,1980
2. A characterisation of universal minimal total dominating functions in trees;Cockayne;Discrete Math.,1995
3. On a generalisation of signed dominating functions of a graph;Cockayne;Ars Combin.,1996
4. Minimality and convexity of domination and related functions in graphs;Cockayne;Utilitas Math.,1997
5. Universal minimal total dominating functions in graphs;Cockayne;Networks,1994
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献