works on
2-domination number 1conjecture proof 1degree sequence 1graph domination 1median degree 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

math.CO2026

The 2-Domination Number and the Upper Median Degree: A Proof of Graffiti.pc Conjecture 387

Jun Qing

The paper proves that for any finite simple graph the 2‑domination number satisfies γ₂(G) ≤ n − m(G) + 1, confirming Graffiti.pc Conjecture 387 and showing the bound is sharp.