Edge Degeneracy: Algorithmic and Structural Results

by   Stratis Limnios, et al.

We consider a cops and robber game where the cops are blocking edges of a graph, while the robber occupies its vertices. At each round of the game, the cops choose some set of edges to block and right after the robber is obliged to move to another vertex traversing at most s unblocked edges (s can be seen as the speed of the robber). Both parts have complete knowledge of the opponent's moves and the cops win when they occupy all edges incident to the robbers position. We introduce the capture cost on G against a robber of speed s. This defines a hierarchy of invariants, namely δ^1_ e,δ^2_ e,…,δ^∞_ e, where δ^∞_ e is an edge-analogue of the admissibility graph invariant, namely the edge-admissibility of a graph. We prove that the problem asking wether δ^s_ e(G)≤ k, is polynomially solvable when s∈{1,2,∞} while, otherwise, it is NP-complete. Our main result is a structural theorem for graphs of bounded edge-admissibility. We prove that every graph of edge-admissibility at most k can be constructed using (≤ k)-edge-sums, starting from graphs whose all vertices, except possibly from one, have degree at most k. Our structural result is approximately tight in the sense that graphs generated by this construction always have edge-admissibility at most 2k-1. Our proofs are based on a precise structural characterization of the graphs that do not contain θ_r as an immersion, where θ_r is the graph on two vertices and r parallel edges.


Recognition of chordal graphs and cographs which are Cover-Incomparability graphs

Cover-Incomparability graphs (C-I graphs) are an interesting class of gr...

Complexity of Edge Monitoring on Some Graph Classes

In this paper, we study the complexity of the edge monitoring problem. A...

The complete set of minimal simple graphs that support unsatisfiable 2-CNFs

A propositional logic sentence in conjunctive normal form that has claus...

The mixed search game against an agile and visible fugitive is monotone

We consider the mixed search game against an agile and visible fugitive....

An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs

In this draft we prove an interesting structural property related to the...

The Weighted Sitting Closer to Friends than Enemies Problem in the Line

The weighted Sitting Closer to Friends than Enemies (SCFE) problem is to...

Construction numbers: How to build a graph?

We count the number of ways to build paths, stars, cycles, and complete ...

Please sign up or login with your details

Forgot password? Click here to reset