Zobrazeno 1 - 10
of 58
pro vyhledávání: '"Penso, Lucia D."'
The independence number $\alpha(G)$ and the dissociation number ${\rm diss}(G)$ of a graph $G$ are the largest orders of induced subgraphs of $G$ of maximum degree at most $0$ and at most $1$, respectively. We consider possible improvements of the ob
Externí odkaz:
http://arxiv.org/abs/2205.03404
The dissociation number ${\rm diss}(G)$ of a graph $G$ is the maximum order of a set of vertices of $G$ inducing a subgraph that is of maximum degree at most $1$. Computing the dissociation number of a given graph is algorithmically hard even when re
Externí odkaz:
http://arxiv.org/abs/2202.09190
A dissociation set in a graph is a set of vertices inducing a subgraph of maximum degree at most $1$. Computing the dissociation number ${\rm diss}(G)$ of a given graph $G$, defined as the order of a maximum dissociation set in $G$, is algorithmicall
Externí odkaz:
http://arxiv.org/abs/2202.01004
For a graph $G$ and an integer-valued threshold function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbors in it eventually yields th
Externí odkaz:
http://arxiv.org/abs/1802.03935
For a graph $G$ and an integer-valued function $\tau$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that have at least $\tau(u)$ neighbors in it eventually yields the vertex s
Externí odkaz:
http://arxiv.org/abs/1802.03754
We show the hardness of the geodetic hull number for chordal graphs.
Externí odkaz:
http://arxiv.org/abs/1704.02242
Publikováno v:
In Theoretical Computer Science 5 March 2022 906:52-63
Autor:
Cappelle, Marcia R., Coelho, Erika M. M., Coelho, Hebert, Penso, Lucia D., Rautenbach, Dieter
We show that an identifying code of minimum order in the complementary prism of a cycle of order $n$ has order $7n/9+\Theta(1)$. Furthermore, we observe that the clique-width of the complementary prism of a graph of clique-width $k$ is at most $4k$,
Externí odkaz:
http://arxiv.org/abs/1507.05083
Publikováno v:
In Discrete Optimization February 2020 35
Publikováno v:
In Electronic Notes in Theoretical Computer Science 30 August 2019 346:241-251