A note on Cops and Robbers, independence number, domination number and diameter
Jan PetrJulien PortierLeo Versteegen
所有作者
Jan PetrJulien PortierLeo Versteegen
文献摘要
We study relations between diameter D(G), domination number γ(G),
independence number α(G) and cop number c(G) of a connected graph G,
showing (i.) c(G)≤α(G)−⌊2D(G)−3⌋, and (ii.)
c(G)≤γ(G)−3D(G)+O(D(G)).