A characterization of Roman trees
From MaRDI portal
Publication:4435567
Recommendations
- Trees with independent Roman domination number twice the independent domination number
- Roman domination dot-critical trees
- Strong equality between the Roman domination and independent Roman domination numbers in trees
- Trees with unique Roman dominating functions of minimum weight
- Global Roman domination in trees
Cited in
(58)- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Algorithmic results for weak Roman domination problem in graphs
- Perfect Roman domination in trees
- On maximal Roman domination in graphs
- A note on the edge Roman domination in trees
- Relating the annihilation number and the Roman domination number
- Roman domination dot-critical trees
- Roman domination on strongly chordal graphs
- Inverse roman domination in graphs
- Restrained Roman domination in graphs
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs
- Trees with independent Roman domination number twice the independent domination number
- Double Roman domination in trees
- Algorithmic complexity of weakly connected Roman domination in graphs
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Perfect double Roman domination of trees
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
- A note on the Roman domatic number of a digraph
- Roman domination dot-critical graphs
- On the strong Roman domination number of graphs
- On the Roman domination stable graphs
- Upper bounds on Roman domination numbers of graphs
- Trees with unique Roman dominating functions of minimum weight
- The Roman domination number of some special classes of graphs - convex polytopes
- Strong equality of Roman and weak Roman domination in trees
- Total perfect codes in graphs realized by commutative rings
- Roman domination in regular graphs
- Outer-independent total Roman domination in graphs
- Bounds on the locating Roman domination number in trees
- Perfect Italian domination in trees
- Global Roman domination in trees
- Algorithmic aspects of Roman domination in graphs
- A lower bound for the second Zagreb index of trees with given Roman domination number
- Resolving Roman domination in graphs
- Weak Roman subdivision number of graphs
- Algorithmic aspects of Roman graphs
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
- Roman dominating influence parameters
- Locating Roman domination in graphs
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set
- Chromatic transversal Roman domination in graphs
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Signed Roman domination in graphs
- Extremal problems on weak Roman domination number
- Some improved inequalities related to Vizing's conjecture
- Trees with vertex-edge Roman domination number twice the domination number minus one
- Roman domination in graphs
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
- Roman domination in graphs.
- On the global Roman domination number in graphs
- Global Roman domination in graphs
- Roman domination and Mycieleki's structure in graphs.
- A characterization of double Roman trees
- Maximum second Zagreb index of trees with given Roman domination number
- A constructive characterization of vertex cover Roman trees
- Varieties of Roman domination. II
- Roman domination in a tree.
- Roman domination in unicyclic graphs
This page was built for publication: A characterization of Roman trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435567)
