A094087 Domination number of the Cartesian product of two n-cycles.
1, 2, 3, 4, 5, 8, 12, 16, 18, 20, 27, 32, 38, 42, 45, 56, 64, 71, 76, 80, 95, 104, 114, 120, 125, 144, 155
Offset: 1
Links
- Navid Assadian, Dominating Sets of the Cartesian Products of Cycles, M. Sc. project, University of Victoria, 2019.
- S. Klavžar and N. Seifter, Dominating Cartesian products of cycles, Discrete Applied Mathematics, Vol. 59 (1995), no. 2, pp. 129-136.
- Stephan Mertens, Domination Polynomials of the Grid, the Cylinder, the Torus, and the King Graph, arXiv:2408.08053 [math.CO], 2024. See p. 15.
- Zehui Shao, Jin Xu, S. M. Sheikholeslami, and Shaohui Wang, The Domination Complexity and Related Extremal Values of Large 3D Torus, Complexity, 2018, 3041426.
- Eric Weisstein's World of Mathematics, Domination Number
- Eric Weisstein's World of Mathematics, Torus Grid Graph
Formula
a(5n) = 5n^2. - Richard Bean, Jun 08 2006
Extensions
More terms from Richard Bean, Sep 08 2006
a(22) from Richard Bean, Jul 24 2018
a(23)-a(24) from Shao et al. added by Andrey Zabolotskiy, Dec 23 2019
a(25)-a(27) from Richard Bean, Apr 03 2022
Comments