Showing cs.DMShow all
3 papers · 1 filter
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 be a finite simple undirected graph with vertex set , edge set and vertex subset . is termed \emph{open-dominating} if every v…
cs.DM2018
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 of a graph is if all vertices belonging to any shortest path between two vertices of lie in . The card…
cs.DM2018
On the Geodetic Hull Number of Complementary Prisms
Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento +1
Let be a finite, simple, and undirected graph and let be a set of vertices of . In the geodetic convexity, a set of vertices of a graph is convex if all vertices…