Pages that link to "Item:Q5370823"
From MaRDI portal
The following pages link to Global total Roman domination in graphs (Q5370823):
Displaying 11 items.
- Nordhaus-Gaddum bounds for total Roman domination (Q1698063) (← links)
- On the total Roman domination in trees (Q1717206) (← links)
- An \(O(|E(G)|^2)\) algorithm for recognizing Pfaffian graphs of a type of bipartite graphs (Q1743482) (← links)
- Total Roman reinforcement in graphs (Q2312053) (← links)
- On the total and strong version for Roman dominating functions in graphs (Q2662879) (← links)
- Global Domination (Q3384618) (← links)
- Total Roman domatic number of a graph (Q4985437) (← links)
- On computing secure domination of trees (Q5025125) (← links)
- γ-induced-paired dominating graphs of paths and cycles (Q6115755) (← links)
- Global dominating broadcast in graphs (Q6174167) (← links)
- Twin signed double Roman domination numbers in directed graphs (Q6174748) (← links)
