Pages that link to "Item:Q1025980"
From MaRDI portal
The following pages link to On the Roman domination number of a graph (Q1025980):
Displaying 47 items.
- Perfect double Roman domination of trees (Q777364) (← links)
- Constructive characterizations concerning weak Roman domination in trees (Q777409) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- Note on 2-rainbow domination and Roman domination in graphs (Q972956) (← links)
- Weak \(\{2\}\)-domination number of Cartesian products of cycles (Q1698059) (← links)
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- On the global Roman domination number in graphs (Q1708687) (← links)
- On the co-Roman domination in graphs (Q1717198) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- A note on the bounds of Roman domination numbers (Q2144876) (← links)
- Independent double Roman domination in graphs (Q2304392) (← links)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- Extremal digraphs for an upper bound on the Roman domination number (Q2331577) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- On the differential and Roman domination number of a graph with minimum degree two (Q2410222) (← links)
- Exact algorithms for weak Roman domination (Q2413969) (← links)
- Total Roman domination in the lexicographic product of graphs (Q2420413) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Roman domination in direct product graphs and rooted product graphs (Q2671126) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- Independent Roman domination and 2-independence in trees (Q4577859) (← links)
- Mixed Roman domination and 2-independence in trees (Q4583517) (← links)
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH (Q4928332) (← links)
- Critical graphs with Roman domination number four (Q4956166) (← links)
- Independent double Roman domination in graphs (Q4956191) (← links)
- Total Roman domatic number of a graph (Q4985437) (← links)
- Bounds on the co-Roman domination number in graphs (Q4985578) (← links)
- Properties of double Roman domination on cardinal products of graphs (Q4993967) (← links)
- On roman domination number of functigraph and its complement (Q4997712) (← links)
- Algorithmic aspects of total Roman {3}-domination in graphs (Q5025138) (← links)
- Global double Roman domination in graphs (Q5030493) (← links)
- (Q5045984) (← links)
- Lower and upper bounds on independent double Roman domination in trees (Q5054041) (← links)
- (Q5061786) (← links)
- Algorithmic aspects of outer independent Roman domination in graphs (Q5101892) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- (Q5134323) (← links)
- A note on the Roman domatic number of a digraph (Q5212896) (← links)
- Trees with equal Roman {2}-domination number and independent Roman {2}-domination number (Q5242342) (← links)
- A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers (Q5242940) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Isolate Roman domination in graphs (Q5866034) (← links)
- (Q5866362) (← links)
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs (Q6158956) (← links)
- An \(iP_2\) extended star graph and its harmonious chromatic number (Q6498094) (← links)
