Abstract
We investigate the domination game and the game domination number $\unicode[STIX]{x1D6FE}_{g}$ in the class of split graphs. We prove that $\unicode[STIX]{x1D6FE}_{g}(G)\leq n/2$ for any isolate-free $n$-vertex split graph $G$, thus strengthening the conjectured $3n/5$ general bound and supporting Rall’s $\lceil n/2\rceil$-conjecture. We also characterise split graphs of even order with $\unicode[STIX]{x1D6FE}_{g}(G)=n/2$.
Publisher
Cambridge University Press (CUP)
Reference21 articles.
1. Domination game on paths and cycles
2. Extremal Problems for Game Domination Number
3. Finding balance: split graphs and related classes;Collins;Electron. J. Combin.,2018
4. Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
5. [17] W. B. Kinnersley , D. B. West and R. Zamani , ‘Game domination for grid-like graphs’, Manuscript, 2012.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献