Affiliation:
1. Department of Mathematics, University of Haifa-Oranim, Geva 18915, Israel
2. Department of Mathematics, Beit-Berl College and School of Mathematical Sciences, Tel-Aviv University, Israel
Abstract
Thek-domination number of a graphG=G(V,E),γk(G), is the least cardinality of a setX⊂Vsuch that any vertex inVXis adjacent to at leastkvertices ofX.Extending a result of Cockayne, Gamble and Shepherd [4], we prove that ifδ(G)≥n+1nk−1,n≥1,k≥1then,γk(G)≤npn+1, wherepis the order ofG.
Subject
Mathematics (miscellaneous)
Cited by
45 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献