Domination in designs
Felix Goldberg, Deepak Rajendraprasad, Rogers Mathew

TL;DR
This paper explores domination numbers in the incidence graphs of combinatorial designs, providing bounds, exact values for specific designs, and proposing conjectures about Steiner triple systems.
Contribution
It introduces new bounds and exact values for domination numbers in various combinatorial designs, especially Steiner systems, and proposes a conjecture on Steiner triple systems.
Findings
Finite projective planes have domination number 2n.
Symmetric (v,k,λ)-designs satisfy γ ≤ 2k.
Steiner triple systems have γ ≥ (2/3)v - 1.
Abstract
We commence the study of domination in the incidence graphs of combinatorial designs. Let be a combinatorial design and denote by the domination number of the incidence (Levy) graph of . We obtain a number of results about the domination numbers of various kinds of designs. For instance, a finite projective plane of order , which is a symmetric -design, has . %We also show that for any symmetric -design it holds that . We study at depth the domination numbers of Steiner systems and in particular of Steiner triple systems. We show that a has and also obtain a number of upper bounds. The tantalizing conjecture that all Steiner triple systems on vertices have the same domination number is proposed and is verified up to . The structure of minimal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory · Advanced Graph Theory Research
