The domination game on split graphs

14Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate the domination game and the game domination number in the class of split graphs. We prove that for any isolate-free -vertex split graph , thus strengthening the conjectured general bound and supporting Rall's -conjecture. We also characterise split graphs of even order with .

Cite

CITATION STYLE

APA

James, T., Klavžar, S., & Vijayakumar, A. (2019). The domination game on split graphs. Bulletin of the Australian Mathematical Society, 99(2), 327–337. https://doi.org/10.1017/S0004972718001053

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free