A characterization relating domination, semitotal domination and total Roman domination in trees
From MaRDI portal
Publication:4957559
Recommendations
- ON THE CHARACTERIZATION OF ROMAN DOMINATING SETS IN TREES
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
- Constructive characterizations concerning weak Roman domination in trees
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Semitotal domination in trees
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Domination versus semipaired domination in trees
- A note on the semitotal domination number of a tree.
- On trees with domination number equal to edge-vertex Roman domination number
- A characterization of trees with equal domination and total domination numbers.
Cited in
(12)- On the total Roman domination in trees
- Construction for trees without domination critical vertices
- Relating the total \(\{2\}\)-domination number with the total domination number of graphs
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- A characterization of trees with equal Roman 2-domination and Roman domination numbers
- On the total Roman domination stability in graphs
- Quasi-total Roman bondage number in graphs
- Quasi-total Roman reinforcement in graphs
- Total restrained Roman domination
- New bounds on the outer-independent total double Roman domination number
- Global restrained Roman domination in graphs
- Constructive characterizations concerning weak Roman domination in trees
This page was built for publication: A characterization relating domination, semitotal domination and total Roman domination in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4957559)
