Partitioning vertices into in- and out-dominating sets in digraphs

DOI10.1016/J.DAM.2020.05.021MaRDI QIDQ2197403zbMATHOpenAlexFDO

Authors Kosuke Nakamura, Toru Araki

Publication date 31 August 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2020.05.021

zbMATH Keywords

graph algorithmdigraphdominationin-dominationout-dominationdomatic partition

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Sum of out-domination number and in-domination number of digraphs
• On the out-domination and in-domination numbers of a digraph
• Domination in digraphs
• Out-degree reducing partitions of digraphs
• Finding good 2-partitions of digraphs. II. Enumerable properties

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302196 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (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?)
• Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Digraphs
• Graphs \& digraphs
• Kernels in planar digraphs
• On the \((h,k)\)-domination numbers of iterated line digraphs
• On the out-domination and in-domination numbers of a digraph
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• Towards a theory of domination in graphs

Cited in

(8)

• Safe sets and in-dominating sets in digraphs
• Partitioning the vertex set of an acyclic directed graph into convex subsets
• On the parameterized complexity of 2-partitions
• The algorithmic complexity of domination digraphs
• Mod-2 independence and domination in graphs
• Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
• Out-degree reducing partitions of digraphs
• Partitioning the vertices of a cubic graph into two total dominating sets

This page was built for publication: Partitioning vertices into in- and out-dominating sets in digraphs

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