Magda Dettlaff - Profil naukowy - MOST Wiedzy

Wyszukiwarka

Media społecznościowe

Kontakt

Adiunkt

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

Wybrane publikacje

  • 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

  • Bondage number of grid graphs

    The bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Domination subdivision and domination multisubdivision numbers of graphs

    The domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...

    Pełny tekst do pobrania w portalu

wyświetlono 866 razy