scientific article; zbMATH DE number 7812864

DOI10.22049/cco.2022.27661.1309MaRDI QIDQ6149323

Abolfazl Poureidi

Publication date: 5 March 2024

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

zbMATH Keywords

algorithmdynamic programminggeneralized Petersen graphdouble Roman dominating function

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Double Roman domination
• Some progress on the double Roman domination in graphs
• Double Roman domination in trees
• Face covers and the genus problem for apex graphs
• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• On algorithmic complexity of double Roman domination
• Maximal double Roman domination in graphs
• Outer independent double Roman domination
• Algorithmic results on double Roman domination in graphs
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• On the double Roman domination in graphs
• Double Roman domination and domatic numbers of graphs
• Complexity of Roman {2}-domination and the double Roman domination in graphs
• Total double Roman domination in graphs
• A theorem on tait colorings with an application to the generalized Petersen graphs

This page was built for publication: