Efficient domination of the orientations of a graph

DOI10.1016/S0012-365X(97)81813-4zbMath0906.05033OpenAlexW2063734883MaRDI QIDQ1377863

Lane H. Clark, Anthony E. Barkauskas, David W. Bange, Linda H. Host

Publication date: 14 February 1999

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(97)81813-4

zbMATH Keywords

extremal graphsorientationdominating setrandom oriented graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

A Taxonomy of Perfect Domination ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ On bondage numbers of graphs: a survey with some comments ⋮ Efficient total domination in digraphs ⋮ On efficiently total dominatable digraphs ⋮ The bondage numbers and efficient dominations of vertex-transitive graphs ⋮ Reinforcement numbers of digraphs ⋮ Efficient dominating sets in labeled rooted oriented trees

Cites Work

• The number of maximal independent sets in a connected graph
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient domination of the orientations of a graph