scientific article; zbMATH DE number 7814385

DOI10.22049/CCO.2023.27884.1385MaRDI QIDQ6150942

Jafar Fathali, Abolfazl Poureidi

Publication date: 7 March 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmNP-completeAPX-completeproper interval graphtriple Roman domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Double Roman domination
• Counting independent sets in tree convex bipartite graphs
• Approximation hardness of dominating set problems in bounded degree graphs
• Optimization, approximation, and complexity classes
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Some APX-completeness results for cubic graphs
• Secure domination in proper interval graphs
• Global triple Roman dominating function
• Total Roman \(\{2\}\)-dominating functions in graphs
• Optimal greedy algorithms for indifference graphs
• Triple Roman domination in graphs
• Double Roman domination and domatic numbers of graphs
• Triple Roman domination subdivision number in graphs

This page was built for publication: