Game domination subdivision number of a graph

O. Favaron (), H. Karami and S. M. Sheikholeslami ()
Additional contact information
O. Favaron: Université Paris-Sud and CNRS, LRI, UMR 8623
H. Karami: Azarbaijan Shahid Madani University
S. M. Sheikholeslami: Azarbaijan Shahid Madani University

Journal of Combinatorial Optimization, 2015, vol. 30, issue 1, No 9, 109-119

Abstract: Abstract The game domination subdivision number of a graph $$G$$ G is defined by the following game. Two players $$\mathcal D $$ D and $$\mathcal A $$ A , $$\mathcal D $$ D playing first, alternately mark or subdivide an edge of $$G$$ G which is not yet marked nor subdivided. The game ends when all the edges of $$G$$ G are marked or subdivided and results in a new graph $$G^{\prime }$$ G ′ . The purpose of $$\mathcal D $$ D is to minimize the domination number $$\gamma (G^{\prime })$$ γ ( G ′ ) of $$G^{\prime }$$ G ′ while $$\mathcal A $$ A tries to maximize it. If both $$\mathcal A $$ A and $$\mathcal D $$ D play according to their optimal strategies, $$\gamma (G^{\prime })$$ γ ( G ′ ) is well defined. We call this number the game domination subdivision number of $$G$$ G and denote it by $$\gamma _{gs}(G)$$ γ gs ( G ) . In this paper we initiate the study of the game domination subdivision number of a graph and present sharp bounds on the game domination subdivision number of a tree.

Keywords: Domination number; Game domination subdivision number; Trees; Subdivision; Game domination number (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9636-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9636-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9636-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().