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

DOI10.3390/MATH6100206zbMATH Open1515.05139OpenAlexW2891885186WikidataQ129087127 ScholiaQ129087127MaRDI QIDQ6162014FDOQ6162014

Yongsheng Rao, Zehui Shao, Jiabao 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)

Cites Work

• Title not available (Why is that?)
• Vertex domination of generalized Petersen graphs
• A characterization of Roman trees
• Signed Roman edge domination numbers in graphs
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• Double Roman domination
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• Roman domination on 2-connected graphs
• Edge Roman domination on graphs
• Upper bounds on Roman domination numbers of graphs
• Double Roman domination in trees
• Title not available (Why is that?)
• On the signed Roman \(k\)-domination: complexity and thin torus graphs
• The domination complexity and related extremal values of large 3D torus
• Roman domination in unicyclic graphs

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6162014)