Vertex-addition strategy for domination-like invariants

zbMath1369.05160MaRDI QIDQ2401431

Naoki Matsumoto, Michitaka Furuya

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p45

zbMATH Keywords

dominationtotal dominationRoman domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for Roman domination on some classes of graphs
• Roman domination in regular graphs
• On graphs having domination number half their order
• Roman domination in graphs.
• Difference between 2-rainbow domination and roman domination in graphs
• Roman Domination on 2-Connected Graphs
• Domination in graphs with minimum degree two
• Extremal Problems for Roman Domination
• Total domination in graphs
• Domination-balanced graphs
• Graphs with large total domination number
• Total Domination in Graphs

This page was built for publication: Vertex-addition strategy for domination-like invariants