A. Roux

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.CO2020

Critical graphs upon multiple edge subdivision

Magda Dettlaff, Magdalena Lemanska, Adriana Roux

A subset $D$ of $V$ is \emph{dominating} in $G$ if every vertex of $V - D$ has at least one neighbour in $D;$ let $γ (G)$ be the minimum cardinality among all dominating sets in $G .$ …

math.CO2017★ 1 cited

Connected k-Dominating Graphs

C. M. Mynhardt, R. Roux, L. E. Teshima

For a graph G=(V,E), the k-dominating graph of G, denoted by $D_{k} (G)$ , has vertices corresponding to the dominating sets of G having cardinality at most k, where two vertices of…