Grinberg-Introduction-Graph-Theory · Problem 2.17

Simple graphs

Mathematics — Graph Theory · dominating-sets-cycle-graphs

Problem

Let n≥3n \geq 3 be an integer. Find a formula for the smallest size of a dominating set of the cycle graph CnC_n. You can use the ceiling function x↦⌈x⌉x \mapsto \lceil x \rceil, which sends a real number xx to the smallest integer that is ≥x\geq x.

Browse the problem library