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

DOI10.3390/MATH6100206MaRDI QIDQ6162014zbMATH OpenOpenAlexWikidataFDO

Authors Huiqin Jiang, Pu Wu, Zehui Shao, Yongsheng Rao, Jiabao Liu

Publication date 15 June 2023

Published in Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3368692 (Why is no real title available?)
• 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
• 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
• A characterization of Roman trees
• Double Roman domination
• Double Roman domination in trees
• Edge Roman domination on graphs
• On the signed Roman \(k\)-domination: complexity and thin torus graphs
• Roman domination in unicyclic graphs
• Roman domination on 2-connected graphs
• Signed Roman edge domination numbers in graphs
• The domination complexity and related extremal values of large 3D torus
• Upper bounds on Roman domination numbers of graphs
• Vertex domination of generalized Petersen graphs

Cited in

(3)

• Varieties of Roman Domination
• Double Roman domination in generalized Petersen graphs
• 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)