A note on Cops and Robbers, independence number, domination number and diameter

02/25/2022
by   Jan Petr, et al.
0

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)-⌊D(G)-3/2⌋, and (ii.) c(G) ≤γ (G) - D(G)/3 + O (√(D(G))).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/07/2022

Geodetic convexity and Kneser graphs

The Kneser graph K(2n+k,n), for positive integers n and k, is the graph ...
research
01/11/2019

Alternation diameter of a product object

We prove that every permutation of a Cartesian product of two finite set...
research
08/16/2020

Diameter Polytopes of Feasible Binary Programs

Feasible binary programs often have multiple optimal solutions, which is...
research
01/09/2020

What is the Value of Data? On Mathematical Methods for Data Quality Estimation

Data is one of the most important assets of the information age, and its...
research
07/15/2021

A note on hyperopic cops and robber

We explore a variant of the game of Cops and Robber introduced by Bonato...
research
07/11/2012

Stable Independance and Complexity of Representation

The representation of independence relations generally builds upon the w...
research
02/14/2020

Extremal independence old and new

On 12 February 2020 the Royal Statistical Society hosted a meeting to di...

Please sign up or login with your details

Forgot password? Click here to reset