Magdalena Lemańska - Profil naukowy - MOST Wiedzy

Wyszukiwarka

Kontakt dla biznesu

Centrum Transferu Wiedzy i Technologii
Lokalizacja
Al. Zwycięstwa 27, 80-219 Gdańsk
Telefon
+48 58 348 62 62
E-mail
biznes@pg.edu.pl

Media społecznościowe

Kontakt

Adiunkt

Miejsce pracy
Gmach B pokój 516 A
Telefon
(58) 347 28 61

Wybrane publikacje

  • On the partition dimension of trees

    - DISCRETE APPLIED MATHEMATICS - Rok 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 vv and the set Pi. A partition Π of V is a resolving partition of G if different vertices of G have different partition representations, i.e., for every...

    Pełny tekst do pobrania w portalu

  • On the super domination number of lexicographic product graphs

    - DISCRETE APPLIED MATHEMATICS - Rok 2019

    The neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...

    Pełny tekst do pobrania w portalu

  • Super Dominating Sets in Graphs

    In this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.

    Pełny tekst do pobrania w serwisie zewnętrznym

Uzyskane stopnie/tytuły naukowe

  • 2006-01-19

    Nadanie stopnia naukowego

    dr Matematyka (Dziedzina nauk matematycznych)
    Wydział Matematyki, Fizyki i Informatyki Uniwersytetu Gdańskiego

wyświetlono 3416 razy