48 citations · 75 across the 7 of their papers we have counts for
10 papers
Graphs with isolation number equal to one third of the order
Magdalena Lemanska, Mercè Mora, María José Souto-Salorio
A set of vertices of a graph is isolating if the set of vertices not in or with no neighbor in is independent. The isolation number of , denoted by , is th…
Critical graphs upon multiple edge subdivision
Magda Dettlaff, Magdalena Lemanska, Adriana Roux
A subset of is \emph{dominating} in if every vertex of has at least one neighbour in let be the minimum cardinality among all dominating sets in …
On the super domination number of lexicographic product graphs
M. Dettlaff, M. Lemańska, J. A. Rodríguez-Velázquez +1
The neighbourhood of a vertex of a graph is the set of all vertices adjacent to in . For we define . A set $D\…
Coronas and domination subdivision number of a graph
Magda Dettlaff, Magdalena Lemańska, Jerzy Topp +1
In this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G \circ P of G. Among several properties of this new operation,…
Relations between edge removing and edge subdivision concerning domination number of a graph
Magdalena Lemańska, Joaquín Tey, Rita Zuazua
Let be an edge of a connected simple graph . The graph obtained by removing (subdividing) an edge from is denoted by (). As usual, denotes the domi…
Total domination multisubdivision number of a graph
Diana Avella-Alaminos, Magda Dettlaff, Magdalena Lemańska +1
The domination multisubdivision number of a nonempty graph was defined as the minimum positive integer such that there exists an edge which must be subdivided times to…