An overview of graphical weighted-subset problems. Paired-domination in graphs. 1-17 05C35 Efficient coverage of edge sets in graphs. Closed neighborhood order dominating functions. Efficient and excess domination in graphs.
All cycles are edge-magic.
The automorphism class theorem for LP-based graphical parameters. Inequalities relating domination parameters in cubic graphs. 129-143 05C35 Generalized domination and efficient domination in graphs. Complexity results for closed neighborhood order parameters. On maximum sum problems in graphs.