Independent domination in directed graphs

DOI10.22049/cco.2020.26845.1149zbMath1488.05368arXiv1909.05121OpenAlexW3085817308MaRDI QIDQ4957541

Savari Prabhu, Michael Cary, Jonathan Cary

Publication date: 9 September 2021

Full work available at URL: https://arxiv.org/abs/1909.05121

zbMATH Keywords

independent setdominating setindependent dominating setindependent dominationidomatic number

Mathematics Subject Classification ID

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

Related Items (2)

Classes of intersection digraphs with good algorithmic properties ⋮ Efficient algorithms for independent Roman domination on some classes of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On approximating the minimum independent dominating set
• Domination, independent domination, and duality in strongly chordal graphs
• Idomatic partitions of direct products of complete graphs
• Disjoint independent dominating sets in graphs
• An upper bound for the independent domination number
• On the independent domination number of graphs with given minimum degree
• A note on connected bipartite graphs having independent domination number half their order.
• On a Nordhaus-Gaddum type problem for independent domination
• Independent domination in graphs: A survey and recent results
• Independent rainbow domination of graphs
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Broadcasts in graphs
• Decycling numbers of random regular graphs
• Minimum independent dominating sets of random cubic graphs
• On the Independent Domination Number of Random Regular Graphs

This page was built for publication: Independent domination in directed graphs