Roman domination excellent graphs: trees

DOI10.22049/cco.2017.25806.1041zbMath1384.05125arXiv1610.00297OpenAlexW2964157881MaRDI QIDQ4635024

V. Samodivkin

Publication date: 13 April 2018

Full work available at URL: https://arxiv.org/abs/1610.00297

zbMATH Keywords

treesRoman domination numberexcellent graphs

Mathematics Subject Classification ID

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

Related Items (2)

Roman Domination in Graphs ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets

Cites Work

• \(\gamma\)-excellent, critically dominated, end-dominated, and dot-critical trees are equivalent
• Minus domination in graphs
• Changing and unchanging domination: A classification
• Roman domination in graphs.
• A characterization of \(i\)-excellent trees
• Total domination excellent trees
• Signed Roman domination in graphs
• Extremal Problems for Roman Domination
• The bondage number of graphs:good and bad vertices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Roman domination excellent graphs: trees