Skip to content

Author

Jun Qing

We have 1 of 13 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Jul 2026

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

Let G be a nonempty finite simple graph of order n, and let m(G) be the upper median of its degree sequence. We prove that the 2-domination number satisfies gamma_2(G)<= n - m(G) + 1. This proves Graffiti.pc Conjecture 387. In fact, the argument establishes the inequality for every nonempty finite simple graph, so the...

Jun Qing · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.