Pages that link to "Item:Q423913"
From MaRDI portal
The following pages link to Directed domination in oriented graphs (Q423913):
Displaying 21 items.
- On the rainbow domination number of digraphs (Q343745) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- On a relation between the domination number and a strongly connected bidirection of an undirected graph (Q1003464) (← links)
- A note on Roman domination of digraphs (Q1630917) (← links)
- Bounds on the signed Roman \(k\)-domination number of a digraph (Q1630924) (← links)
- Distance domination of generalized de Bruijn and Kautz digraphs (Q1692700) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
- Orientable domination in product-like graphs (Q2109114) (← links)
- Double Roman domination in digraphs (Q2272602) (← links)
- Constructing the minimum dominating sets of generalized de Bruijn digraphs (Q2342640) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Oriented Forests in Directed Graphs (Q3439324) (← links)
- (Q4393336) (← links)
- On the sum of the total domination numbers of a digraph and its converse (Q4622851) (← links)
- Projects in (t, r) Broadcast Domination (Q5118419) (← links)
- A note on lower bounds for the total domination number of digraphs (Q5236092) (← links)
- Directed domination in oriented hypergraphs (Q5242948) (← links)
- Dominating Set and Converse Dominating Set of a Directed Graph (Q5563303) (← links)
- Total Roman domination on the digraphs (Q6049701) (← links)
- Orientable burning number of graphs (Q6575409) (← links)