Trees with vertex-edge Roman domination number twice the domination number minus one

DOI10.22199/ISSN.0717-6279-2020-06-0084MaRDI QIDQ5018680zbMATH OpenOpenAlexFDO

Authors H. Naresh Kumar, Yanamandram B. Venkatakrishnan

Publication date 21 December 2021

Published in Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22199/issn.0717-6279-2020-06-0084

zbMATH Keywords

dominating settreesvertex-edge Roman dominating set

Mathematics Subject Classification ID

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

Recommendations

• Vertex-edge Roman domination
• On trees with domination number equal to edge-vertex Roman domination number
• A characterization of Roman trees
• A note on the edge Roman domination in trees
• Trees with independent Roman domination number twice the independent domination number

Cites work

• Bounds on the vertex-edge domination number of a tree
• Double Roman domination in trees
• Global Roman domination in graphs
• Roman domination in graphs.
• Trees with unique Roman dominating functions of minimum weight
• Vertex-edge domination
• Vertex-edge domination in graphs

Cited in

(4)

• Trees with independent Roman domination number twice the independent domination number
• On trees with domination number equal to edge-vertex Roman domination number
• Vertex-edge Roman domination
• The vertex-edge locating Roman domination of some graphs

This page was built for publication: Trees with vertex-edge Roman domination number twice the domination number minus one

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