42 citations · 152 across the 58 of their papers we have counts for
5 papers · 1 filter
Progress towards the two-thirds conjecture on locating-total dominating sets
Dipayan Chakraborty, Florent Foucaud, Anni Hakanen +2
We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set of vertices of a graph is a locating-total dominating set if every vertex of $G…
Characterization of -excellent -trees
Magda Dettlaff, Michael A. Henning, Jerzy Topp
A graph is -excellent if every vertex of the graph is contained in some maximum independent set of the graph. In this paper, we present two characterizations of the -excellen…
End Super Dominating Sets in Graphs
Saieed Akbari, Nima Ghanbari, Michael A. Henning
Let be a simple graph. A dominating set of is a subset such that every vertex not in is adjacent to at least one vertex in . The cardinality of…
On -excellent graphs
M. Dettlaff, M. A. Henning, J. Topp
A graph is -excellent if every vertex of is contained in some maximum independent set of . In this paper, we characterize -excellent bipartite graphs, -excellen…
Common domination perfect graphs
Magda Dettlaff, Michael A. Henning, Jerzy Topp
A dominating set in a graph is a set of vertices such that every vertex that does not belong to is adjacent to a vertex in . The domination number of is t…