Discrete Mathematics & Theoretical Computer Science最新文献

筛选

英文中文

Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$ 路径图 $P_2$ 和 $P_n$ 的笛卡尔积的 Maker-Breaker 支配数

Discrete Mathematics & Theoretical Computer Science Pub Date : 2020-04-27 DOI: 10.46298/dmtcs.10465

J. Forcan, Jiayue Qi

{"title":"Maker-Breaker domination number for Cartesian products of path graphs $P_2$ and $P_n$","authors":"J. Forcan, Jiayue Qi","doi":"10.46298/dmtcs.10465","DOIUrl":"https://doi.org/10.46298/dmtcs.10465","url":null,"abstract":"We study the Maker-Breaker domination game played by Dominator and Staller on\u0000the vertex set of a given graph. Dominator wins when the vertices he has\u0000claimed form a dominating set of the graph. Staller wins if she makes it\u0000impossible for Dominator to win, or equivalently, she is able to claim some\u0000vertex and all its neighbours. Maker-Breaker domination number $gamma_{MB}(G)$\u0000($gamma '_{MB}(G)$) of a graph $G$ is defined to be the minimum number of\u0000moves for Dominator to guarantee his winning when he plays first (second). We\u0000investigate these two invariants for the Cartesian product of any two graphs.\u0000We obtain upper bounds for the Maker-Breaker domination number of the Cartesian\u0000product of two arbitrary graphs. Also, we give upper bounds for the\u0000Maker-Breaker domination number of the Cartesian product of the complete graph\u0000with two vertices and an arbitrary graph. Most importantly, we prove that\u0000$gamma'_{MB}(P_2square P_n)=n$ for $ngeq 1$, $gamma_{MB}(P_2square P_n)$\u0000equals $n$, $n-1$, $n-2$, for $1leq nleq 4$, $5leq nleq 12$, and $ngeq\u000013$, respectively. For the disjoint union of $P_2square P_n$s, we show that\u0000$gamma_{MB}'(dotcup_{i=1}^k(P_2square P_n)_i)=kcdot n$ ($ngeq 1$), and\u0000that $gamma_{MB}(dotcup_{i=1}^k(P_2square P_n)_i)$ equals $kcdot n$,\u0000$kcdot n-1$, $kcdot n-2$ for $1leq nleq 4$, $5leq nleq 12$, and $ngeq\u000013$, respectively.","PeriodicalId":412397,"journal":{"name":"Discrete Mathematics & Theoretical Computer Science","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141209661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Bounds On $(t,r)$ Broadcast Domination of $n$-Dimensional Grids n维网格的$(t,r)$广播支配的边界

Discrete Mathematics & Theoretical Computer Science Pub Date : 2019-08-20 DOI: 10.46298/dmtcs.5732

T. Shlomi

引用次数: 2

The number of {1243, 2134}-avoiding permutations 避免{1243,2134}排列的个数

Discrete Mathematics & Theoretical Computer Science Pub Date : 2013-03-15 DOI: 10.46298/dmtcs.5287

David Callan

引用次数: 2

首页上一页

Discrete Mathematics &amp; Theoretical Computer Science最新文献

Discrete Mathematics & Theoretical Computer Science最新文献