#### Filter Results:

- Full text PDF available (13)

#### Publication Year

1985

2017

- This year (3)
- Last 5 years (11)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Magdalena Lemanska
- Discussiones Mathematicae Graph Theory
- 2004

We prove that the domination number γ(T ) of a tree T on n ≥ 3 vertices and with n1 endvertices satisfies inequality γ(T ) ≥ n+2−n1 3 and we characterize the extremal graphs.

- Magdalena Lemanska
- Discussiones Mathematicae Graph Theory
- 2010

Nordhaus-Gaddum results for weakly convex domination number of a graph G are studied.

Two new domination parameters for a connected graph G: the weakly convex domination number of G and the convex domination number of G are introduced. Relations between these parameters and the other domination parameters are derived. In particular, we study for which cubic graphs the convex domination number equals the connected domination number.

- Magda Dettlaff, Magdalena Lemanska, Ismael González Yero
- Discrete Applied Mathematics
- 2014

- Juan A. Rodríguez-Velázquez, Ismael González Yero, Magdalena Lemanska
- Discrete Applied Mathematics
- 2014

Given an ordered partition Π = {P1, P2, ..., Pt} of the vertex set V of a connected graph G = (V,E), the partition representation of a vertex v ∈ V with respect to the partition Π is the vector r(v|Π) = (d(v, P1), d(v, P2), ..., d(v, Pt)), where d(v, Pi) represents the distance between the vertex v and the set Pi. A partition Π of V is a resolving partition… (More)

- Magdalena Lemanska, Juan A. Rodríguez-Velázquez, Ismael González Yero
- Periodica Mathematica Hungarica
- 2012

The distance dG(u, v) between two vertices u and v in a connected graph G is the length of the shortest uv-path in G. A uv-path of length dG(u, v) is called uv-geodesic. A set X is convex in G if vertices from all ab-geodesics belong to X for every two vertices a, b ∈ X. The convex domination number γcon(G) of a graph G equals the minimum cardinality of a… (More)

- Joanna Raczek, Magdalena Lemanska
- Discrete Applied Mathematics
- 2010

- Joanna Cyman, Magdalena Lemanska, Joanna Raczek
- Discussiones Mathematicae Graph Theory
- 2006

For a connected graph G = (V,E), a set D ⊆ V (G) is a dominating set of G if every vertex in V (G)−D has at least one neighbour in D. The distance dG(u, v) between two vertices u and v is the length of a shortest (u− v) path in G. An (u− v) path of length dG(u, v) is called an (u− v)-geodesic. A set X ⊆ V (G) is convex in G if vertices from all (a −… (More)

- Magdalena Lemanska
- Australasian J. Combinatorics
- 2007

- Ma³gorzata A Jankowska, Magdalena Lemanska, Hanna Trocha, Marta Gesing, Tomasz Smiatacz
- Przegla̧d epidemiologiczny
- 2001

UNLABELLED
Opportunistic infections are one of the major problem among HIV infected patients still connected with high mortality. The aim of the investigation is to evaluate the incidence and mortality from opportunistic infections in HIV infected population in Pomeranian region of Poland. The paper presents analysis of incidence of opportunistic infections… (More)