國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Domination games played on graphs

Bresar, Bostjan.

Domination games played on graphs

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Domination games played on graphsby Bostjan Bresar ... [et al.].
其他作者:	Bresar, Bostjan.
出版者:	Cham :Springer International Publishing :2021.
面頁冊數:	x, 122 p. :ill., digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Mathematical recreations.
電子資源:	https://doi.org/10.1007/978-3-030-69087-8
ISBN:	9783030690878$q(electronic bk.)

Domination games played on graphs
Domination games played on graphs[electronic resource] /by Bostjan Bresar ... [et al.]. - Cham :Springer International Publishing :2021. - x, 122 p. :ill., digital ;24 cm. - SpringerBriefs in mathematics,2191-8198. - SpringerBriefs in mathematics..

1. Introduction -- 2. Domination Game -- 3. Total Domination Game -- 4. Games for Staller -- 5. Related Games on Graphs and Hypergraphs -- References -- Symbol Index.

This concise monograph present the complete history of the domination game and its variants up to the most recent developments and will stimulate research on closely related topics, establishing a key reference for future developments. The crux of the discussion surrounds new methods and ideas that were developed within the theory, led by the imagination strategy, the Continuation Principle, and the discharging method of Bujtas, to prove results about domination game invariants. A toolbox of proof techniques is provided for the reader to obtain results on the domination game and its variants. Powerful proof methods such as the imagination strategy are presented. The Continuation Principle is developed, which provides a much-used monotonicity property of the game domination number. In addition, the reader is exposed to the discharging method of Bujtas. The power of this method was shown by improving the known upper bound, in terms of a graph's order, on the (ordinary) domination number of graphs with minimum degree between 5 and 50. The book is intended primarily for students in graph theory as well as established graph theorists and it can be enjoyed by anyone with a modicum of mathematical maturity. The authors include exact results for several families of graphs, present what is known about the domination game played on subgraphs and trees, and provide the reader with the computational complexity aspects of domination games. Versions of the games which involve only the "slow" player yield the Grundy domination numbers, which connect the topic of the book with some concepts from linear algebra such as zero-forcing sets and minimum rank. More than a dozen other related games on graphs and hypergraphs are presented in the book. In all these games there are problems waiting to be solved, so the area is rich for further research. The domination game belongs to the growing family of competitive optimization graph games. The game is played by two competitors who take turns adding a vertex to a set of chosen vertices. They collaboratively produce a special structure in the underlying host graph, namely a dominating set. The two players have complementary goals: one seeks to minimize the size of the chosen set while the other player tries to make it as large as possible. The game is not one that is either won or lost. Instead, if both players employ an optimal strategy that is consistent with their goals, the cardinality of the chosen set is a graphical invariant, called the game domination number of the graph. To demonstrate that this is indeed a graphical invariant, the game tree of a domination game played on a graph is presented for the first time in the literature.

ISBN: 9783030690878$q(electronic bk.)

Standard No.: 10.1007/978-3-030-69087-8doiSubjects--Topical Terms:

189602
Mathematical recreations.

LC Class. No.: QA95

Dewey Class. No.: 793.74

Domination games played on graphs
LDR:03891nmm a2200337 a 4500 001 597975
003 DE-He213
005 20210730105615.0
006 m d
007 cr nn 008maaau
008 211019s2021 sz s 0 eng d
020 $a 9783030690878$q(electronic bk.)
020 $a 9783030690861$q(paper)
024 7 $a 10.1007/978-3-030-69087-8 $2 doi
035 $a 978-3-030-69087-8
040 $a GP $c GP
041 0 $a eng
050 4 $a QA95
072 7 $a PBV $2 bicssc
072 7 $a MAT013000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 793.74 $2 23
090 $a QA95 $b .D671 2021
245 0 0 $a Domination games played on graphs $h [electronic resource] / $c by Bostjan Bresar ... [et al.].
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a x, 122 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in mathematics, $x 2191-8198
505 0 $a 1. Introduction -- 2. Domination Game -- 3. Total Domination Game -- 4. Games for Staller -- 5. Related Games on Graphs and Hypergraphs -- References -- Symbol Index.
520 $a This concise monograph present the complete history of the domination game and its variants up to the most recent developments and will stimulate research on closely related topics, establishing a key reference for future developments. The crux of the discussion surrounds new methods and ideas that were developed within the theory, led by the imagination strategy, the Continuation Principle, and the discharging method of Bujtas, to prove results about domination game invariants. A toolbox of proof techniques is provided for the reader to obtain results on the domination game and its variants. Powerful proof methods such as the imagination strategy are presented. The Continuation Principle is developed, which provides a much-used monotonicity property of the game domination number. In addition, the reader is exposed to the discharging method of Bujtas. The power of this method was shown by improving the known upper bound, in terms of a graph's order, on the (ordinary) domination number of graphs with minimum degree between 5 and 50. The book is intended primarily for students in graph theory as well as established graph theorists and it can be enjoyed by anyone with a modicum of mathematical maturity. The authors include exact results for several families of graphs, present what is known about the domination game played on subgraphs and trees, and provide the reader with the computational complexity aspects of domination games. Versions of the games which involve only the "slow" player yield the Grundy domination numbers, which connect the topic of the book with some concepts from linear algebra such as zero-forcing sets and minimum rank. More than a dozen other related games on graphs and hypergraphs are presented in the book. In all these games there are problems waiting to be solved, so the area is rich for further research. The domination game belongs to the growing family of competitive optimization graph games. The game is played by two competitors who take turns adding a vertex to a set of chosen vertices. They collaboratively produce a special structure in the underlying host graph, namely a dominating set. The two players have complementary goals: one seeks to minimize the size of the chosen set while the other player tries to make it as large as possible. The game is not one that is either won or lost. Instead, if both players employ an optimal strategy that is consistent with their goals, the cardinality of the chosen set is a graphical invariant, called the game domination number of the graph. To demonstrate that this is indeed a graphical invariant, the game tree of a domination game played on a graph is presented for the first time in the literature.
650 0 $a Mathematical recreations. $3 189602
650 0 $a Graph theory. $3 181880
650 1 4 $a Graph Theory. $3 522732
700 1 $a Bresar, Bostjan. $3 891498
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a SpringerBriefs in mathematics. $3 558795
856 4 0 $u https://doi.org/10.1007/978-3-030-69087-8
950 $a Mathematics and Statistics (SpringerNature-11649)