Dominating sets in directed graphs

DOI10.1016/J.INS.2010.06.009MaRDI QIDQ991901zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The directed dominating set problem: generalized leaf removal and belief propagation
• Dominating sets of random 2-in 2-out directed graphs
• Dominating sets and domatic number of circular arc graphs
• On maximum number of minimal dominating sets in graphs
• Elimination properties for minimal dominating sets of graphs

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1124608 (Why is no real title available?)
• scientific article; zbMATH DE number 2191983 (Why is no real title available?)
• Database Theory - ICDT 2005
• Dimension of the crown \(S^k_n\)
• Maintaining transitive closure in first order after node-set and edge-set deletions
• On the out-domination and in-domination numbers of a digraph

Cited in

(25)

• Convergence analysis of some faster iterative schemes for \(G\)-nonexpansive mappings in convex metric spaces endowed with a graph
• Total domination in digraphs
• Finding the minimum number of elements with sum above a threshold
• Convergence analysis of SP-iteration for \(G\)-nonexpansive mappings with directed graphs
• On the domination polynomial of a digraph: a generation function approach
• Dominating sets and connected dominating sets in dynamic graphs
• Fixed point theorems for multivalued nonself \(G\)-almost contractions in Banach spaces endowed with graphs
• The domination number of round digraphs
• On Browder's convergence theorem and Halpern iteration process for \(G\)-nonexpansive mappings in Hilbert spaces endowed with graphs
• Dominating Set Counting in Graph Classes
• A regularization method for solving the G-variational inequality problem and fixed-point problems in Hilbert spaces endowed with graphs
• On rainbow domination numbers of graphs
• The directed dominating set problem: generalized leaf removal and belief propagation
• The method for solving fixed point problem of \(G\)-nonexpansive mapping in Hilbert spaces endowed with graphs and numerical example
• Combinatorial settlement planning
• Dominating Set and Converse Dominating Set of a Directed Graph
• Finding minimum weight connected dominating set in stochastic graph based on learning automata
• On \(G(\lambda)\)-strictly pseudocontractive mapping in Hilbert spaces
• Bounds on the domination number of a digraph and its reverse
• Directed domination in oriented graphs
• Bipolar fuzzy graphs
• Independent rainbow domination of graphs
• Directed dominating set problem studied by cavity method: warning propagation and population dynamics
• An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
• Convergence theorems for \(G\)-nonexpansive mappings in convex metric spaces with a directed graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991901)