Pages that link to "Item:Q450576"
From MaRDI portal
The following pages link to Efficient total domination in digraphs (Q450576):
Displaying 17 items.
- Efficient domination through eigenvalues (Q317399) (← links)
- On weighted efficient total domination (Q414423) (← links)
- Efficient domination in cubic vertex-transitive graphs (Q449200) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- On efficiently total dominatable digraphs (Q1714019) (← links)
- Worst-case efficient dominating sets in digraphs (Q1949100) (← links)
- Existence of efficient total dominating sets of circulant graphs of degree 4 (Q2286605) (← links)
- Packing and domination parameters in digraphs (Q2328107) (← links)
- The total bondage numbers and efficient total dominations of vertex-transitive graphs (Q2333221) (← links)
- Efficient domination in knights graphs (Q2370394) (← links)
- Efficient closed domination in digraph products (Q2424797) (← links)
- (Q3011738) (← links)
- Domination in Digraphs (Q3384119) (← links)
- (Q3413877) (← links)
- A Taxonomy of Perfect Domination (Q5069690) (← links)
- k-Efficient domination: Algorithmic perspective (Q6115759) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)