CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
unknown
The Disjoint Domination Game
Authors
Csilla Bujtás
Zsolt Tuza
Publication date
1 January 2016
Publisher
'Elsevier BV'
Doi
Cite
Abstract
We introduce and study a Maker-Breaker type game in which the issue is to create or avoid two disjoint dominating sets in graphs without isolated vertices. We prove that the maker has a winning strategy on all connected graphs if the game is started by the breaker. This implies the same in the (2:1) biased game also in the maker-start game. It remains open to characterize the maker-win graphs in the maker-start non-biased game, and to analyze the (a:b) biased game for (a:b)≠(2:1). For a more restricted variant of the non-biased game we prove that the maker can win on every graph without isolated vertices. © 2015 Elsevier B.V
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Repository of the Academy's Library
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:real.mtak.hu:39567
Last time updated on 28/02/2017