Directed domination in oriented graphs

DOI10.1016/j.dam.2011.12.027zbMath1242.05198arXiv1010.2464OpenAlexW2041964508MaRDI QIDQ423913

Yair Caro, Michael A. Henning

Publication date: 30 May 2012

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

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

zbMATH Keywords

independence numberoriented graphdirected domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (16)

A note on Roman domination of digraphs ⋮ Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ Directed domination in oriented hypergraphs ⋮ On the rainbow domination number of digraphs ⋮ Total Roman domination on the digraphs ⋮ Distance domination of generalized de Bruijn and Kautz digraphs ⋮ Bounds on the domination number of a digraph ⋮ Projects in (t, r) Broadcast Domination ⋮ On the sum of the total domination numbers of a digraph and its converse ⋮ A greedy partition lemma for directed domination ⋮ Double Roman domination in digraphs ⋮ Domination in Digraphs ⋮ A note on lower bounds for the total domination number of digraphs ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Constructing the minimum dominating sets of generalized de Bruijn digraphs ⋮ Orientable domination in product-like graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A greedy partition lemma for directed domination
• A note on graphs which have upper irredundance equal to independence
• Small transversals in hypergraphs
• On the out-domination and in-domination numbers of a digraph
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
• Transversal numbers of uniform hypergraphs
• Tight lower bounds on the size of a maximum matching in a regular graph
• On the degrees of the vertices of a directed graph
• An inequality for the chromatic number of a graph
• Dominating Set and Converse Dominating Set of a Directed Graph
• On a Problem in Graph Theory

This page was built for publication: Directed domination in oriented graphs