A note on Cops and Robbers, independence number, domination number and diameter
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:KBOXIPBErecord.jsonopen to challenge →
classification
math.CO
cs.DM
keywords
numberalphadiameterdominationfracgammaindependenceconnected
read the original abstract
We study relations between diameter $D(G)$, domination number $\gamma(G)$, independence number $\alpha(G)$ and cop number $c(G)$ of a connected graph $G$, showing (i.) $c(G) \leq \alpha(G)-\lfloor \frac{D(G)-3}{2} \rfloor$, and (ii.) $c(G) \leq \gamma (G) - \frac{D(G)}{3} + O (\sqrt{D(G)})$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.