Pages that link to "Item:Q456341"
From MaRDI portal
The following pages link to Roman domination number of the Cartesian products of paths and cycles (Q456341):
Displaying 20 items.
- A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs (Q284833) (← links)
- On rainbow domination numbers of graphs (Q497921) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Roman domination problem with uncertain positioning and deployment costs (Q781325) (← links)
- Domination parameters with number 2: interrelations and algorithmic consequences (Q1682877) (← links)
- Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- Algebraic approach to fasciagraphs and rotagraphs (Q1917348) (← links)
- The secure domination number of Cartesian products of small graphs with paths and cycles (Q2065763) (← links)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- Independent rainbow domination of graphs (Q2421364) (← links)
- The 2-domination number of cylindrical graphs (Q2678854) (← links)
- Roman domination number on cardinal product of paths and cycles (Q2966436) (← links)
- Some results for Roman domination number on Cardinal product of paths and cycles (Q2975269) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- Independent Roman domination and 2-independence in trees (Q4577859) (← links)
- Mixed Roman domination and 2-independence in trees (Q4583517) (← links)
- Global double Roman domination in graphs (Q5030493) (← links)
- On the 2-domination Number of Cylinders with Small Cycles (Q5074058) (← links)
