Robustness: a New Form of Heredity Motivated by Dynamic Networks

by   Arnaud Casteigts, et al.

We investigate a special case of hereditary property in graphs, referred to as robustness. A property (or structure) is called robust in a graph G if it is inherited by all the connected spanning subgraphs of G. We motivate this definition using two different settings of dynamic networks. The first corresponds to networks of low dynamicity, where some links may be permanently removed so long as the network remains connected. The second corresponds to highly-dynamic networks, where communication links appear and disappear arbitrarily often, subject only to the requirement that the entities are temporally connected in a recurrent fashion ( i.e. they can always reach each other through temporal paths). Each context induces a different interpretation of the notion of robustness. We start by motivating the definition and discussing the two interpretations, after what we consider the notion independently from its interpretation, taking as our focus the robustness of maximal independent sets (MIS). A graph may or may not admit a robust MIS. We characterize the set of graphs in which all MISs are robust. Then, we turn our attention to the graphs that admit a robust MIS (). This class has a more complex structure; we give a partial characterization in terms of elementary graph properties, then a complete characterization by means of a (polynomial time) decision algorithm that accepts if and only if a robust MIS exists. This algorithm can be adapted to construct such a solution if one exists.


page 1

page 2

page 3

page 4


Isomorphism Problem for S_d-graphs

An H-graph is the intersection graph of connected subgraphs of a suitabl...

When Should You Wait Before Updating? Toward a Robustness Refinement

Consider a dynamic network and a given distributed problem. At any point...

Almost Well-Covered Graphs Without Short Cycles

We study graphs in which the maximum and the minimum sizes of a maximal ...

Graphs with G^p-connected medians

The median of a graph G with weighted vertices is the set of all vertice...

Design of Polynomial-delay Enumeration Algorithms in Transitive Systems

In this paper, as a new notion, we define a transitive system to be a se...

Robust Connectivity of Graphs on Surfaces

Let Λ(T) denote the set of leaves in a tree T. One natural problem is to...

Asymptotic equipartition property for a Markov source having ambiguous alphabet

We propose a generalization of the asymptotic equipartition property to ...

Please sign up or login with your details

Forgot password? Click here to reset