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

DOI10.1007/s00373-022-02471-5zbMath1486.05219OpenAlexW4220889734MaRDI QIDQ2121485

Noor A'lawiah Abd Aziz, Michael A. Henning, Hailiza Kamarulhaili, Nader Jafari Rad

Publication date: 4 April 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-022-02471-5

zbMATH Keywords

Roman dominationTurán's theorem\(k\)-tuple domination\(k\)-dominationRoman \(k\)-tuple domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
• Roman domination in graphs.
• New bounds on the \(k\)-domination number and the \(k\)-tuple domination number
• Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
• Roman Domination in Graphs
• ROMAN k-DOMINATION IN GRAPHS
• Total Domination in Graphs
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• Roman k-tuple domination number of a graph

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