Vertex-edge Roman domination

DOI10.46793/KGJMAT2105.685KzbMATH Open1499.05475OpenAlexW4231854581MaRDI QIDQ5035233FDOQ5035233

Authors:

Publication date: 21 February 2022

Published in: Kragujevac Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: http://elib.mi.sanu.ac.rs/files/journals/kjm/67/2_eng.html

Recommendations

• Trees with vertex-edge Roman domination number twice the domination number minus one
• Total vertex-edge domination
• On trees with domination number equal to edge-vertex Roman domination number
• Double vertex-edge domination
• Total vertex-edge domination in trees

zbMATH Keywords

treesedge dominating setvertex-edge Roman dominating set

Mathematics Subject Classification ID

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

Cites Work

• Roman domination in graphs.
• Bounds on weak Roman and 2-rainbow domination numbers
• Bounds on the vertex-edge domination number of a tree
• Vertex-edge domination
• Title not available (Why is that?)
• Vertex-edge domination in graphs
• Trees with unique Roman dominating functions of minimum weight

Cited In (5)

• Title not available (Why is that?)
• Trees with vertex-edge Roman domination number twice the domination number minus one
• On trees with domination number equal to edge-vertex Roman domination number
• Title not available (Why is that?)
• Edge Roman domination on graphs

This page was built for publication: Vertex-edge Roman domination

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