Indexed metadata

Domination and Total Domination in Johnson graphs

María Gracia Cornet, Tanja Dravec, Pablo Torres

Source record

Source: arXiv

Published: Oct 3, 2026

arXiv: 2610.04675

Open original source ↗

Source abstract

In this paper we study domination and total domination of Johnson graphs J(n,k)J(n,k). We establish monotonicity results proving that both γ(J(n,k))γ(J(n,k)) and γt(J(n,k))γ_t(J(n,k)) are non-decreasing with respect to nn. We compute exact values for γt(J(n,k))γ_t(J(n,k)) in specific cases, showing that γt(J(n,2))=⌈23(n−1)⌉γ_t(J(n,2))=\lceil\frac{2}{3}(n-1)\rceil for n≥4n\geq 4, and determining γt(J(n,3))γ_t(J(n,3)) for n≥6n\geq 6, which depends quadratically on nn.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Domination and Total Domination in Johnson graphs — Mathematical Frontier Network