The following pages link to Dominating sets in directed graphs (Q991901):
Displayed 20 items.
- On Browder's convergence theorem and Halpern iteration process for \(G\)-nonexpansive mappings in Hilbert spaces endowed with graphs (Q288185) (← links)
- Bipolar fuzzy graphs (Q424788) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- Finding the minimum number of elements with sum above a threshold (Q497136) (← links)
- On rainbow domination numbers of graphs (Q497921) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- The method for solving fixed point problem of \(G\)-nonexpansive mapping in Hilbert spaces endowed with graphs and numerical example (Q1985924) (← links)
- Convergence theorems for \(G\)-nonexpansive mappings in convex metric spaces with a directed graph (Q2047467) (← links)
- The domination number of round digraphs (Q2053549) (← links)
- Convergence analysis of SP-iteration for \(G\)-nonexpansive mappings with directed graphs (Q2272632) (← links)
- Fixed point theorems for multivalued nonself \(G\)-almost contractions in Banach spaces endowed with graphs (Q2397010) (← links)
- Independent rainbow domination of graphs (Q2421364) (← links)
- (Q3306017) (← links)
- (Q3384743) (← links)
- Directed Dominating Set Problem Studied by Cavity Method: Warning Propagation and Population Dynamics (Q3387676) (← links)
- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation (Q3452554) (← links)
- Bounds on the domination number of a digraph and its reverse (Q5024936) (← links)
- On the domination polynomial of a digraph: a generation function approach (Q5065224) (← links)
- Total domination in digraphs (Q5236071) (← links)
- (Q6183269) (← links)