On trees with domination number equal to edge-vertex roman domination number

DOI10.1142/S1793830921500452zbMath1475.05135OpenAlexW3112882099MaRDI QIDQ5013503

H. Naresh Kumar, Yanamandram B. Venkatakrishnan

Publication date: 30 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500452

zbMATH Keywords

treesdominating setedge-vertex Roman dominating set

Mathematics Subject Classification ID

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

Related Items (2)

Total vertex-edge domination in graphs: Complexity and algorithms ⋮ Edge-vertex domination in trees

Cites Work

• Unnamed Item
• Unnamed Item
• On trees with total domination number equal to edge-vertex domination number plus one
• Roman domination in graphs.
• An improved upper bound of edge-vertex domination number of a tree
• Trees with unique Roman dominating functions of minimum weight

This page was built for publication: On trees with domination number equal to edge-vertex roman domination number