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

DOI10.1016/J.DAM.2020.05.021zbMATH Open1451.05193OpenAlexW3035676160MaRDI QIDQ2197403FDOQ2197403

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Digraphs
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
• Title not available (Why is that?)
• Title not available (Why is that?)
• Towards a theory of domination in graphs
• Title not available (Why is that?)
• Kernels in planar digraphs
• The \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• On the out-domination and in-domination numbers of a digraph
• Title not available (Why is that?)
• Connected \(k\)-tuple twin domination in de Bruijn and Kautz digraphs
• On the \((h,k)\)-domination numbers of iterated line digraphs

Cited In (4)

• Partitioning the vertex set of an acyclic directed graph into convex subsets
• Partitioning the vertices of a cubic graph into two total dominating sets
• Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
• Out-degree reducing partitions of digraphs

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)