A characterization of Roman trees
From MaRDI portal
Publication:4435567
DOI10.7151/dmgt.1178zbMath1030.05093OpenAlexW2090249824MaRDI QIDQ4435567
Publication date: 17 November 2003
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1178
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (43)
A note on the Roman domatic number of a digraph ⋮ Strong equality of Roman and weak Roman domination in trees ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Roman domination dot-critical graphs ⋮ A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers ⋮ Weak Roman subdivision number of graphs ⋮ Extremal problems on weak Roman domination number ⋮ Trees with unique Roman dominating functions of minimum weight ⋮ On the strong Roman domination number of graphs ⋮ Roman domination on strongly chordal graphs ⋮ Perfect Roman domination in trees ⋮ The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) ⋮ Global Roman domination in graphs ⋮ Double Roman domination in trees ⋮ Some improved inequalities related to Vizing's conjecture ⋮ On the global Roman domination number in graphs ⋮ A constructive characterization of vertex cover Roman trees ⋮ Signed Roman domination in graphs ⋮ Unnamed Item ⋮ Roman domination in graphs. ⋮ A characterization of double Roman trees ⋮ Roman dominating influence parameters ⋮ Unnamed Item ⋮ Perfect Italian domination in trees ⋮ ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS ⋮ Algorithmic Aspects of Quasi-Total Roman Domination in Graphs ⋮ Trees with independent Roman domination number twice the independent domination number ⋮ A characterization of trees having a minimum vertex cover which is also a minimum total dominating set ⋮ Unnamed Item ⋮ Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs ⋮ Roman Domination in Graphs ⋮ Algorithmic aspects of Roman domination in graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Roman domination in regular graphs ⋮ Unnamed Item ⋮ Upper bounds on Roman domination numbers of graphs ⋮ Roman domination in unicyclic graphs ⋮ Perfect double Roman domination of trees ⋮ Outer-independent total Roman domination in graphs ⋮ A note on the edge Roman domination in trees ⋮ INVERSE ROMAN DOMINATION IN GRAPHS ⋮ Algorithmic complexity of weakly connected Roman domination in graphs ⋮ ALGORITHMIC ASPECTS OF ROMAN GRAPHS
This page was built for publication: A characterization of Roman trees
