A graph theoretical approach to optimizing minimum Italian domination sets
From MaRDI portal
Cites work
- A note on the independent domination number in graphs
- Defending the Roman Empire---a new strategy
- Domination versus independent domination in graphs of small regularity
- Double Roman domination
- Fundamental dominations in graphs
- Global italian domination in graphs
- Hamiltonian properties of Toeplitz graphs
- Independent domination in cubic graphs
- Independent domination in subcubic graphs of girth at least six
- Independent domination of graphs with bounded maximum degree
- Independent domination versus packing in subcubic graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- On the chromatic number of Toeplitz graphs
- Perfect Italian domination in trees
- Power domination in graphs
- Restrained double Roman domination of a graph
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Roman \(\{2 \}\)-domination
- Structural properties of Toeplitz graphs
- The exact domination number of the generalized Petersen graphs
- The property of Hamiltonian connectedness in Toeplitz graphs
- Topics in Domination in Graphs
This page was built for publication: A graph theoretical approach to optimizing minimum Italian domination sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956404)