Trees with unique Roman dominating functions of minimum weight

DOI10.1142/S1793830914500384MaRDI QIDQ2920886zbMATH OpenOpenAlexFDO

Authors Mustapha Chellali, Nader Jafari Rad

Publication date 29 September 2014

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

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

zbMATH Keywords

Roman dominationtree

Mathematics Subject Classification ID

Trees (05C05) Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A characterization of Roman trees
• Roman domination dot-critical trees
• Roman domination in graphs.
• Roman domination in a tree.
• Strong equality between the Roman domination and independent Roman domination numbers in trees

Cites work

• A characterization of Roman trees
• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• Trees with unique minimum total dominating sets

Cited in

(14)

• Unique response Roman domination in graphs
• On the Roman domination stable graphs
• Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
• Roman domination in a tree.
• Roman domination in graphs
• A characterization of Roman trees
• The unique response Roman domination in trees
• On trees with domination number equal to edge-vertex Roman domination number
• Trees with vertex-edge Roman domination number twice the domination number minus one
• Vertex-edge Roman domination
• Chromatic transversal Roman domination in graphs
• Roman domination dot-critical trees
• Unique paired vs edge-vertex minimum dominating sets in trees
• The signed (total) Roman domination problem on some classes of planar graphs -- convex polytopes

This page was built for publication: Trees with unique Roman dominating functions of minimum weight

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