The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)

DOI10.3390/math6100206zbMath1515.05139OpenAlexW2891885186WikidataQ129087127 ScholiaQ129087127MaRDI QIDQ6162014

Yongsheng Rao, Zehui Shao, Jia-Bao Liu, Huiqin Jiang, Pu Wu

Publication date: 15 June 2023

Published in: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/math6100206

zbMATH Keywords

generalized Petersen graphsdouble Roman dominationdischarging approach

Mathematics Subject Classification ID

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

Related Items (3)

Integer linear programming formulations for double roman domination problem ⋮ Double Roman domination in generalized Petersen graphs ⋮ Varieties of Roman Domination

Cites Work

• Double Roman domination
• Edge Roman domination on graphs
• Upper bounds on Roman domination numbers of graphs
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• Vertex domination of generalized Petersen graphs
• Double Roman domination in trees
• The domination complexity and related extremal values of large 3D torus
• On the signed Roman \(k\)-domination: complexity and thin torus graphs
• Roman domination in unicyclic graphs
• Roman Domination on 2-Connected Graphs
• A characterization of Roman trees
• Signed Roman edge domination numbers in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)