Magdalena Lemańska - Science profile - Bridge of Knowledge

Search

Social media

Contact

Assistant professor

Workplace
Gmach B pokój 516 A
Phone
(58) 347 28 61

Publication showcase

  • On the partition dimension of trees

    - DISCRETE APPLIED MATHEMATICS - Year 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...

    Full text available to download

  • On the super domination number of lexicographic product graphs

    - DISCRETE APPLIED MATHEMATICS - Year 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...

    Full text available to download

  • 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.

    Full text to download in external service

Obtained scientific degrees/titles

  • 2006-01-19

    Obtained science degree

    dr Mathematics (Mathematics)
    Wydział Matematyki, Fizyki i Informatyki Uniwersytetu Gdańskiego

seen 3416 times