Pages that link to "Item:Q2247105"
From MaRDI portal
The following pages link to Maximal double Roman domination in graphs (Q2247105):
Displaying 13 items.
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle (Q2115152) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- Lower and upper bounds on independent double Roman domination in trees (Q5054041) (← links)
- (Q5354542) (← links)
- On the outer independent total double Roman domination in graphs (Q6042155) (← links)
- Total Roman domination on the digraphs (Q6049701) (← links)
- (Q6097712) (← links)
- An improved upper bound on the independent double Roman domination number of trees (Q6101465) (← links)
- Further results on independent double roman trees (Q6101482) (← links)
- (Q6149323) (← links)
- New results on quadruple Roman domination in graphs (Q6174161) (← links)
- On maximal Roman domination in graphs: complexity and algorithms (Q6593946) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)