Author:
Henning Michael A.,Ananchuen Nawarat,Kaemawichanurat Pawaton
Funder
University of Johannesburg
Subject
Applied Mathematics,Computational Mathematics
Reference29 articles.
1. On domination critical graphs with cut vertices having connected domination number 3;Ananchuen;Int. Math. Forum,2007
2. A parameterized measure-and-conquer analysis for finding a k-leaf spanning tree in an undirected graph;Binkele-Raible;Discrete Math. Theor. Comput. Sci.,2014
3. Connected domination and spanning trees with many leaves;Caro;SIAM J. Discrete Math.,2000
4. Connected domination critical graphs;Chen;Appl. Math. Letters,2004
5. Permutation graphs: connected domination and steiner trees;Colbourn;Discrete Math.,1990
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献