Pages that link to "Item:Q2307496"
From MaRDI portal
The following pages link to Algorithmic and complexity aspects of problems related to total Roman domination for graphs (Q2307496):
Displaying 14 items.
- Roman domination on strongly chordal graphs (Q385486) (← links)
- Algorithmic aspects of total Roman and total double Roman domination in graphs (Q831689) (← links)
- Algorithmic aspects of Roman domination in graphs (Q2053064) (← links)
- Nearly tight approximation algorithm for (connected) Roman dominating set (Q2080821) (← links)
- Computing strong Roman domination of trees and unicyclic graphs in linear time (Q2082401) (← links)
- Exact Algorithms for Weak Roman Domination (Q2870018) (← links)
- Varieties of Roman Domination (Q3384116) (← links)
- Algorithmic complexity of weakly connected Roman domination in graphs (Q5866025) (← links)
- Efficient algorithms for independent Roman domination on some classes of graphs (Q6097713) (← links)
- Algorithmic aspects of total Roman ${2}$-domination in graphs (Q6101489) (← links)
- The statistical analysis for Sombor indices in a random polygonal chain networks (Q6110612) (← links)
- Complexity aspects of restrained Roman domination in graphs (Q6132244) (← links)
- (Q6155858) (← links)
- Hop total Roman domination in graphs (Q6166240) (← links)