Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs

DOI10.1007/s10878-021-00735-zzbMath1475.05146OpenAlexW3157752031MaRDI QIDQ2045048

Shou-Jun Xu, Yu Yang, Hong-Juan Wang, Cai-Xia Wang

Publication date: 11 August 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00735-z

zbMATH Keywords

complexitytreesRoman \(\{k\}\)-domination number

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Roman domination on strongly chordal graphs
• Italian domination in trees
• Rainbow domination in graphs
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
• Unit disk graphs
• Roman domination in graphs.
• Rainbow domination and related problems on strongly chordal graphs
• Rainbow Domination and Related Problems on Some Classes of Perfect Graphs
• Dominating Sets in Chordal Graphs
• A characterization of Roman trees

This page was built for publication: Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs