Magdalena Lemańska
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Magdalena Lemańska has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Magda Dettlaff
Faculty of Applied Physics and Mathematics, Gdańsk University of Technology, Gdańsk, Poland
17 shared publications - Juan Alberto Rodriguez-Velazquez
Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Spain
9 shared publications - Ismael Gonzalez Yero
Departamento de Matemáticas, Universidad de Cádiz, Algeciras Campus, Spain
8 shared publications - Joanna Raczek
Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Gdansk, Poland
5 shared publications - Rita Zuazua
National Autonomous University of Mexico Mexico
5 shared publications - Jerzy Topp
University of Gdansk, Gdansk, Poland
4 shared publications
Latest Publications
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (2) , 569
On covers and domination in trees
- 1 January 2026
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 46 (2) , 569
On covers and domination in trees
- Open Access
- 18 December 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 26 (1) , #P1.10
Mobile mutual-visibility sets in graphs
AMC is a journal published by University of Primorska.
- 18 December 2025
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 26 (1) , #P1.10
Open AccessMobile mutual-visibility sets in graphs
AMC is a journal published by University of Primorska.
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (1) , 331
Restrained differential of a graph
- 1 January 2025
- Published by University of Zielona Góra, Poland in Discussiones Mathematicae Graph Theory
- Vol. 45 (1) , 331
Restrained differential of a graph
- 19 February 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (5)
Graphs with isolation number equal to one third of the order
- 19 February 2024
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (5)
Graphs with isolation number equal to one third of the order
- 18 March 2022
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 45 (11) , 7050-7057
On proper (1,2)‐dominating sets in graphs
In 2008, Hedetniemi et al. introduced the concept of ‐domination and obtained some interesting results for ‐domination. Obviously every ‐dominating set of a graph (known as 2‐dominating set) is ‐dominating; to distinguish these concepts, we define a proper ‐dominating set of a graph as follows: a subset is a proper ‐dominating set of a graph if is ‐dominating and it is not a ‐dominating set of a graph. In particular, we introduce proper ‐domination parameters and study their relations with ‐domination parameters and the classical domination numbers.
- 18 March 2022
- Published by Wiley in Mathematical Methods in the Applied Sciences
- Vol. 45 (11) , 7050-7057
On proper (1,2)‐dominating sets in graphs
In 2008, Hedetniemi et al. introduced the concept of ‐domination and obtained some interesting results for ‐domination. Obviously every ‐dominating set of a graph (known as 2‐dominating set) is ‐dominating; to distinguish these concepts, we define a proper ‐dominating set of a graph as follows: a subset is a proper ‐dominating set of a graph if is ‐dominating and it is not a ‐dominating set of a graph. In particular, we introduce proper ‐domination parameters and study their relations with ‐domination parameters and the classical domination numbers.
- Open Access
Common Independence in Graphs
The cardinality of a largest independent set of G, denoted by , is called the independence number of G. The independent domination number of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by , as the greatest integer r such that every vertex of G belongs to some independent subset X of with . The common independence number of G is the limit of symmetry in G with respect to the fact that each vertex of G belongs to an independent set of cardinality in G, and there are vertices in G that do not belong to any larger independent set in G. For any graph G, the relations between above parameters are given by the chain of inequalities . In this paper, we characterize the trees T for which , and the block graphs G for which .Open AccessCommon Independence in Graphs
The cardinality of a largest independent set of G, denoted by , is called the independence number of G. The independent domination number of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by , as the greatest integer r such that every vertex of G belongs to some independent subset X of with . The common independence number of G is the limit of symmetry in G with respect to the fact that each vertex of G belongs to an independent set of cardinality in G, and there are vertices in G that do not belong to any larger independent set in G. For any graph G, the relations between above parameters are given by the chain of inequalities . In this paper, we characterize the trees T for which , and the block graphs G for which . - Open Access
- 9 June 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (12) , 1325
Isolation Number versus Domination Number of Trees
If is a graph of order n, we call an isolating set if the graph induced by contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by It is known that and the bound is sharp. A subset is called dominating in G if . The minimum cardinality of a dominating set of G is the domination number, and it is denoted by In this paper, we analyze a family of trees T where , and we prove that implies Moreover, we give different equivalent characterizations of such graphs and we propose simple algorithms to build these trees from the connections of stars.- 9 June 2021
- Published by MDPI AG in Mathematics
- Vol. 9 (12) , 1325
Open AccessIsolation Number versus Domination Number of Trees
If is a graph of order n, we call an isolating set if the graph induced by contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by It is known that and the bound is sharp. A subset is called dominating in G if . The minimum cardinality of a dominating set of G is the domination number, and it is denoted by In this paper, we analyze a family of trees T where , and we prove that implies Moreover, we give different equivalent characterizations of such graphs and we propose simple algorithms to build these trees from the connections of stars. - Open Access
- 13 March 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (3) , 691-709
Independent Domination Subdivision in Graphs
- 13 March 2021
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 37 (3) , 691-709
Open AccessIndependent Domination Subdivision in Graphs
- Open Access
- 28 October 2020
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 41 (1) , 56-72
Secure Italian domination in graphs
An Italian dominating function (IDF) on a graph G is a function $$f:V(G)\rightarrow \{0,1,2\}$$ such that for every vertex v with $$f(v)=0$$ , the total weight of f assigned to the neighbours of v is at least two, i.e., $$\sum _{u\in N_G(v)}f(u)\ge 2$$ . For any function $$f:V(G)\rightarrow \{0,1,2\}$$ and any pair of adjacent vertices with $$f(v) = 0$$ and u with $$f(u) > 0$$ , the function $$f_{u\rightarrow v}$$ is defined by $$f_{u\rightarrow v}(v)=1$$ , $$f_{u\rightarrow v}(u)=f(u)-1$$ and $$f_{u\rightarrow v}(x)=f(x)$$ whenever $$x\in V(G){\setminus }\{u,v\}$$ . A secure Italian dominating function on a graph G is defined as an IDF f which satisfies that for every vertex v with $$f(v)=0$$ , there exists a neighbour u with $$f(u)>0$$ such that $$f_{u\rightarrow v}$$ is an IDF. The weight of f is $$\omega (f)=\sum _{v\in V(G) }f(v)$$ . The minimum weight among all secure Italian dominating functions on G is the secure Italian domination number of G. This paper is devoted to initiating the study of the secure Italian domination number of a graph. In particular, we prove that the problem of finding this parameter is NP-hard and we obtain general bounds on it. Moreover, for certain classes of graphs, we obtain closed formulas for this novel parameter.- 28 October 2020
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 41 (1) , 56-72
Open AccessSecure Italian domination in graphs
An Italian dominating function (IDF) on a graph G is a function $$f:V(G)\rightarrow \{0,1,2\}$$ such that for every vertex v with $$f(v)=0$$ , the total weight of f assigned to the neighbours of v is at least two, i.e., $$\sum _{u\in N_G(v)}f(u)\ge 2$$ . For any function $$f:V(G)\rightarrow \{0,1,2\}$$ and any pair of adjacent vertices with $$f(v) = 0$$ and u with $$f(u) > 0$$ , the function $$f_{u\rightarrow v}$$ is defined by $$f_{u\rightarrow v}(v)=1$$ , $$f_{u\rightarrow v}(u)=f(u)-1$$ and $$f_{u\rightarrow v}(x)=f(x)$$ whenever $$x\in V(G){\setminus }\{u,v\}$$ . A secure Italian dominating function on a graph G is defined as an IDF f which satisfies that for every vertex v with $$f(v)=0$$ , there exists a neighbour u with $$f(u)>0$$ such that $$f_{u\rightarrow v}$$ is an IDF. The weight of f is $$\omega (f)=\sum _{v\in V(G) }f(v)$$ . The minimum weight among all secure Italian dominating functions on G is the secure Italian domination number of G. This paper is devoted to initiating the study of the secure Italian domination number of a graph. In particular, we prove that the problem of finding this parameter is NP-hard and we obtain general bounds on it. Moreover, for certain classes of graphs, we obtain closed formulas for this novel parameter. - 1 June 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 263, 118-129
On the super domination number of lexicographic product graphs
- 1 June 2019
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 263, 118-129
On the super domination number of lexicographic product graphs