Dominating Set and Converse Dominating Set of a Directed Graph

DOI10.2307/2314337zbMath0174.55203OpenAlexW2320538611MaRDI QIDQ5563303

Yumin Fu

Publication date: 1968

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2314337

Mathematics Subject Classification ID

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

Related Items (19)

A note on Roman domination of digraphs ⋮ The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation ⋮ On the rainbow domination number of digraphs ⋮ Total double Roman domination numbers in digraphs ⋮ Bounds on the domination number of a digraph ⋮ Directed domination in oriented graphs ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ Extremal Digraphs for open neighbourhood location-domination and identifying codes ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ An exact exponential-time algorithm for the directed maximum leaf spanning tree problem ⋮ A greedy partition lemma for directed domination ⋮ Domination in a digraph and in its reverse ⋮ Double Roman domination in digraphs ⋮ Domination in Digraphs ⋮ Directed Dominating Set Problem Studied by Cavity Method: Warning Propagation and Population Dynamics ⋮ Total Roman domination in digraphs ⋮ Domination and location in twin-free digraphs ⋮ Packing and domination parameters in digraphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: Dominating Set and Converse Dominating Set of a Directed Graph