Double Roman domination in generalized Petersen graphs

DOI10.1007/s41980-021-00551-5zbMath1491.05143OpenAlexW3137338980MaRDI QIDQ2151479

Yanyan Li

Publication date: 1 July 2022

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-021-00551-5

zbMATH Keywords

generalized Petersen graphRoman dominationdouble Roman dominationdomination on graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Double Roman domination
• Roman domination in graphs.
• Double Roman domination in trees
• A characterization of double Roman trees
• 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
• An upper bound on the double Roman domination number
• The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
• Unnamed Item

This page was built for publication: Double Roman domination in generalized Petersen graphs