Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-19T04:05:29.183Z Has data issue: false hasContentIssue false

THE DOMINATION GAME ON SPLIT GRAPHS

Published online by Cambridge University Press:  12 November 2018

TIJO JAMES
Affiliation:
Department of Mathematics, Pavanatma College, Murickassery, IndiaDepartment of Mathematics, Cochin University of Science and Technology, India email tijojames@gmail.com
SANDI KLAVŽAR*
Affiliation:
Faculty of Mathematics and Physics, University of Ljubljana, SloveniaFaculty of Natural Sciences and Mathematics, University of Maribor, SloveniaInstitute of Mathematics, Physics and Mechanics, Ljubljana, Slovenia email sandi.klavzar@fmf.uni-lj.si
AMBAT VIJAYAKUMAR
Affiliation:
Department of Mathematics, Cochin University of Science and Technology, India email vambat@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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$.

Information

Type
Research Article
Copyright
© 2018 Australian Mathematical Publishing Association Inc.