𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Domination Number of Grids

✍ Scribed by Gonçalves, Daniel; Pinlou, Alexandre; Rao, Michaël; Thomassé, Stéphan

Book ID
118197165
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
386 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The domination numbers of the 5 × n and
The domination numbers of the 5 × n and 6 × n grid graphs
✍ Tony Yu Chang; W. Edwin Clark 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

## Abstract The __k__ × __n__ grid graph is the product __P__~__k__~ × __P__~__n__~ of a path of length __k__ − 1 and a path of length __n__ − 1. We prove here formulas found by E. O. Hare for the domination numbers of __P__~5~ × __P__~__n__~ and __P__~6~ × __P__~__n__~. © 1993 John Wiley & Sons, I

The difference between the domination nu
The difference between the domination number and the minus domination number of a cubic graph
✍ Xiaofan Yang; Qibin Hou; Xiangsheng Huang; Hengnong Xuan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 325 KB

The closed neighborhood of a vertex subset S of a graph G = (V,E), denoted as N[Sj, is defined ss the union of S and the set of all the vertices adjacent to some vertex of S. A dominating set of a graph G = (V, E) is defined as a set S of vertices such that N[q = V. The domination number of a graph

2-Rainbow domination number of
2-Rainbow domination number of
✍ Stȩpień, Zofia; Szymaszkiewicz, Alicja; Szymaszkiewicz, Lucjan; Zwierzchowski, M 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 357 KB