Upper bounds on the \(k\)-tuple (Roman) domination number of a graph

DOI10.1007/s00373-020-02249-7zbMath1459.05239OpenAlexW3097083501MaRDI QIDQ2657089

Michael A. Henning, Nader Jafari Rad

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02249-7

zbMATH Keywords

vertex coverRoman dominationBrooks' theorem\(k\)-tuple domination

Mathematics Subject Classification ID

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

Related Items (3)

Improved bounds on the \(k\)-tuple (Roman) domination number of a graph ⋮ On the domination of triangulated discs ⋮ Varieties of Roman Domination

Cites Work

• Unnamed Item
• Unnamed Item
• Double Roman domination
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• Roman domination in graphs.
• Some progress on the double Roman domination in graphs
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• ROMAN k-DOMINATION IN GRAPHS
• Total Domination in Graphs

This page was built for publication: Upper bounds on the \(k\)-tuple (Roman) domination number of a graph