8 citations · 21 across the 14 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
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…
math.CO2022
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…
math.CO2022
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…