30 citations · 30 across the 5 of their papers we have counts for
9 papers
Relating the independence number and the dissociation number
Felix Bock, Johannes Pardey, Lucia D. Penso +1
The independence number and the dissociation number of a graph are the largest orders of induced subgraphs of of maximum degree at most and at mo…
A bound on the dissociation number
Felix Bock, Johannes Pardey, Lucia D. Penso +1
The dissociation number of a graph is the maximum order of a set of vertices of inducing a subgraph that is of maximum degree at most . Computing the dis…
Relating dissociation, independence, and matchings
Felix Bock, Johannes Pardey, Lucia D. Penso +1
A dissociation set in a graph is a set of vertices inducing a subgraph of maximum degree at most . Computing the dissociation number of a given graph , define…
Dynamic monopolies for interval graphs with bounded thresholds
Stéphane Bessy, Stefan Ehard, Lucia D. Penso +1
For a graph and an integer-valued threshold function on its vertex set, a dynamic monopoly is a set of vertices of such that iteratively adding to it vertices of $G…
Partial immunization of trees
Mitre C. Dourado, Stefan Ehard, Lucia D. Penso +1
For a graph and an integer-valued function on its vertex set, a dynamic monopoly is a set of vertices of such that iteratively adding to it vertices of that hav…
The Geodetic Hull Number is Hard for Chordal Graphs
Stéphane Bessy, Mitre C. Dourado, Lucia D. Penso +1
We show the hardness of the geodetic hull number for chordal graphs.