Dominating sets in directed graphs

DOI10.1016/j.ins.2010.06.009zbMath1231.05208OpenAlexW2161222725MaRDI QIDQ991901

J. Martínez

Publication date: 8 September 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.06.009

zbMATH Keywords

in-dominationdirected graph (digraph)minimal/minimum dominating setout-domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (20)

On Browder's convergence theorem and Halpern iteration process for \(G\)-nonexpansive mappings in Hilbert spaces endowed with graphs ⋮ The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation ⋮ Unnamed Item ⋮ On the domination polynomial of a digraph: a generation function approach ⋮ Fixed point theorems for multivalued nonself \(G\)-almost contractions in Banach spaces endowed with graphs ⋮ Independent rainbow domination of graphs ⋮ Bipolar fuzzy graphs ⋮ Unnamed Item ⋮ An exact exponential-time algorithm for the directed maximum leaf spanning tree problem ⋮ Unnamed Item ⋮ Finding the minimum number of elements with sum above a threshold ⋮ On rainbow domination numbers of graphs ⋮ The method for solving fixed point problem of \(G\)-nonexpansive mapping in Hilbert spaces endowed with graphs and numerical example ⋮ Finding minimum weight connected dominating set in stochastic graph based on learning automata ⋮ Convergence analysis of SP-iteration for \(G\)-nonexpansive mappings with directed graphs ⋮ Convergence theorems for \(G\)-nonexpansive mappings in convex metric spaces with a directed graph ⋮ The domination number of round digraphs ⋮ Directed Dominating Set Problem Studied by Cavity Method: Warning Propagation and Population Dynamics ⋮ Total domination in digraphs ⋮ Bounds on the domination number of a digraph and its reverse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining transitive closure in first order after node-set and edge-set deletions
• Dimension of the crown \(S^k_n\)
• On the out-domination and in-domination numbers of a digraph
• Database Theory - ICDT 2005

This page was built for publication: Dominating sets in directed graphs