Erika M. M. Coelho

activity

20152022

most citedA note on the convexity number for complementary prisms

3 citations · 5 across the 4 of their papers we have counts for

collaborators

5 papers

cs.DS2022

Perfect matching cuts partitioning a graph into complementary subgraphs

Diane Castonguay, Erika M. M. Coelho, Hebert Coelho +2

In Partition Into Complementary Subgraphs (Comp-Sub) we are given a graph $G = (V, E)$ , and an edge set property $Π$ , and asked whether $G$ can be decomposed into two graphs, $H$ and…

cs.DM2021

Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs

Márcia R. Cappelle, Erika Coelho, Les R. Foulds +1

Let $G = (V (G), E (G))$ be a finite simple undirected graph with vertex set $V (G)$ , edge set $E (G)$ and vertex subset $S \subseteq V (G)$ . $S$ is termed \emph{open-dominating} if every v…

cs.DM2018★ 3 cited

A note on the convexity number for complementary prisms

Diane Castonguay, Erika M. M. Coelho, Hebert Coelho +1

In the geodetic convexity, a set of vertices $S$ of a graph $G$ is $convex$ if all vertices belonging to any shortest path between two vertices of $S$ lie in $S$ . The card…

cs.DM2018★ 2 cited

On the Geodetic Hull Number of Complementary Prisms

Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento +1

Let $G$ be a finite, simple, and undirected graph and let $S$ be a set of vertices of $G$ . In the geodetic convexity, a set of vertices $S$ of a graph $G$ is convex if all vertices…

math.CO2015

Identifying Codes in the Complementary Prism of Cycles

Marcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho +2

We show that an identifying code of minimum order in the complementary prism of a cycle of order $n$ has order $7 n /9 + Θ (1)$ . Furthermore, we observe that the clique-width of the com…