Abstract
For a graph G with no isolated vertex, let γpr(G) and sdγpr(G) denote the paired-domination and paired-domination subdivision numbers, respectively. In this note, we show that if T is a tree of order n≥4 different from a healthy spider (subdivided star), then sdγpr(T)≤min{γpr(T)2+1,n2}, improving the (n−1)-upper bound that was recently proven.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference22 articles.
1. Paired-domination in graphs
2. Total and paired-domination in trees;Chellali;AKCE J. Graphs Comb.,2004
3. On paired and double domination in graphs;Chellali;Util. Math.,2005
4. Paired-domination number of a graph and its complement
5. Paired-domination game played in graphs;Haynes;Commun. Comb. Optim.,2019
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献