The following pages link to A characterization of Roman trees (Q4435567):
Displaying 45 items.
- Strong equality of Roman and weak Roman domination in trees (Q284830) (← links)
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Upper bounds on Roman domination numbers of graphs (Q764908) (← links)
- Perfect double Roman domination of trees (Q777364) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Global Roman domination in graphs (Q906445) (← links)
- Roman domination in regular graphs (Q1024464) (← links)
- Roman domination in graphs. (Q1427467) (← links)
- Extremal problems on weak Roman domination number (Q1653022) (← links)
- Perfect Roman domination in trees (Q1693150) (← links)
- Double Roman domination in trees (Q1707975) (← links)
- Some improved inequalities related to Vizing's conjecture (Q1708275) (← links)
- On the global Roman domination number in graphs (Q1708687) (← links)
- A characterization of double Roman trees (Q1735679) (← links)
- Perfect Italian domination in trees (Q1741510) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- A constructive characterization of vertex cover Roman trees (Q2214322) (← links)
- Outer-independent total Roman domination in graphs (Q2328098) (← links)
- Roman domination dot-critical graphs (Q2376108) (← links)
- On the strong Roman domination number of graphs (Q2403792) (← links)
- Signed Roman domination in graphs (Q2444148) (← links)
- Roman dominating influence parameters (Q2463905) (← links)
- Trees with independent Roman domination number twice the independent domination number (Q2788725) (← links)
- Roman domination in unicyclic graphs (Q2833278) (← links)
- INVERSE ROMAN DOMINATION IN GRAPHS (Q2864853) (← links)
- Trees with unique Roman dominating functions of minimum weight (Q2920886) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- The Roman domination number of some special classes of graphs - convex polytopes (Q3390794) (← links)
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS (Q3560065) (← links)
- ALGORITHMIC ASPECTS OF ROMAN GRAPHS (Q4956471) (← links)
- A note on the edge Roman domination in trees (Q5006593) (← links)
- (Q5045984) (← links)
- Weak Roman subdivision number of graphs (Q5063279) (← links)
- (Q5104007) (← links)
- (Q5134323) (← links)
- A note on the Roman domatic number of a digraph (Q5212896) (← links)
- A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers (Q5242940) (← links)
- A characterization of trees having a minimum vertex cover which is also a minimum total dominating set (Q5377033) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- (Q6150894) (← links)
- Algorithmic Aspects of Quasi-Total Roman Domination in Graphs (Q6158956) (← links)
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\) (Q6162014) (← links)
- Approximation algorithm for the minimum partial connected Roman dominating set problem (Q6571270) (← links)
- Algorithmic results for weak Roman domination problem in graphs (Q6633543) (← links)
