4 citations · 18 across the 31 of their papers we have counts for
Showing 2016 · cs.DMShow all
3 papers · 2 filters
cs.DM2016
Upper Domination: towards a dichotomy through boundary properties
Hassan AbouEisha, Shahid Hussain, Vadim Lozin +3
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally N…
cs.DM2016
Graph parameters, Ramsey theory and the speed of hereditary properties
Vadim Lozin
The speed of a hereditary property is the number of -vertex labelled graphs in . It is known that the rates of growth of constitute discrete layers and the sp…
cs.DM2016
More results on weighted independent domination
Vadim Lozin, Dmitriy Malyshev, Raffaele Mosca +1
Weighted independent domination is an NP-hard graph problem, which remains computationally intractable in many restricted graph classes. In particular, the problem is NP-hard in th…