Dominating sets in directed graphs

DOI10.1016/j.ins.2010.06.009zbMath1231.05208MaRDI 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-domination; directed graph (digraph); minimal/minimum dominating set; out-domination

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C20: Directed graphs (digraphs), tournaments

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item