Efficient open domination in digraphs

zbMATH Open1228.05229MaRDI QIDQ3090476FDOQ3090476

Authors: Ludovit Niepel, Martin Knor 

Publication date: 31 August 2011

Recommendations

• Efficient total domination in digraphs
• Graph orientation and its total efficient domination
• Efficient domination of the orientations of a graph
• On efficiently total dominatable digraphs
• Efficient closed domination in digraph products

Mathematics Subject Classification ID

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

Cited In (8)

• Efficient absorbants in generalized de Bruijn digraphs
• Worst-case efficient dominating sets in digraphs
• Graph orientation and its total efficient domination
• Title not available (Why is that?)
• Efficient total domination in digraphs
• Title not available (Why is that?)
• Graphs that are simultaneously efficient open domination and efficient closed domination graphs
• Efficient closed domination in digraph products

This page was built for publication: Efficient open domination in digraphs

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