The cores of paired-domination games
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Velzen introduced the rigid and relaxed dominating set games and showed that the rigid game being balanced is equivalent to the relaxed game being balanced in 2004. After then various variants of dominating set games were introduced and it was shown that for each variant, a rigid game being balanced is equivalent to a relaxed game being balanced. It is natural to ask if for any other variant of dominating set game, the balancedness of a rigid game and the balancedness of a relaxed game are equivalent. In this paper, we show that the answer for the question is negative by considering the rigid and relaxed paired-domination games, which is considered as a variant of dominating set games. We characterize the cores of both games and show that the rigid game being balanced is not equivalent to the relaxed game being balanced. In addition, we study the cores of paired-dominations games on paths and cycles.
Abstract
Velzen introduced the rigid and relaxed dominating set games and showed that the rigid game being balanced is equivalent to the relaxed game being balanced in 2004. After then various variants of dominating set games were introduced and it was shown that for each variant, a rigid game being balanced is equivalent to a relaxed game being balanced. It is natural to ask if for any other variant of dominating set game, the balancedness of a rigid game and the balancedness of a relaxed game are equivalent. In this paper, we show that the answer for the question is negative by considering the rigid and relaxed paired-domination games, which is considered as a variant of dominating set games. We characterize the cores of both games and show that the rigid game being balanced is not equivalent to the relaxed game being balanced. In addition, we study the cores of paired-dominations games on paths and cycles.
참고문헌 (10)
- J. M. Bilbao, "Cooperative games on combinatorial structures" (2000), Kluwer Academic Publishers
- T. Bietenhader, "Core stability of minimum coloring games", Mathematics of Operations Research, 31, pp.418~431 (2006)
- X. Deng, "Algoritheoremic aspects of the core of combina-torial optimization games", Mathematics of Operations Research, 24, pp.751~766 (1999)
- T. W. Haynes, "Paired-domination in graphs", Networks, 32, pp.199~206 (1998)
- 김혜경, "Balancedness of Integer Domination Games", 대한수학회지, 43(2), pp.297~309 (2006), 대한수학회
- 김혜경, "Balancedness and Concavity of Fractional Domination Games", 대한수학회보, 43(2), pp.265~275 (2006), 대한수학회
- Y. Liu, "Balancedness of edge covering games", Applied Mathematics Letters, 20, pp.1064~1069 (2007)
- Y. Okamoto, "Fair cost allocations under con icts -a game-theoretic point of view-", Discrete Optimization, 5, pp.1~18 (2008)
- B. Park, "On the cores of games arising from integer edge covering functions of graphs"
- B. V. Velzen, "Dominating set games", Operations Research Letters, 32, pp.565~573 (2004)