Graph orientation and its total efficient domination

MaRDI QIDQ5310317zbMATH OpenFDO

Authors Di Chen, Zhiquan Hu

Publication date 9 October 2007

zbMATH Keywords

one-cycle graphthe number of total efficienciestotal efficient dominating set

Mathematics Subject Classification ID

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

Recommendations

• Efficient total domination in digraphs
• On efficiently total dominatable digraphs
• Efficient open domination in digraphs
• Efficient domination of the orientations of a graph
• scientific article; zbMATH DE number 637310

Cited in

(10)

• Efficient domination of the orientations of a graph
• On reorienting graphs by pushing down maximal vertices. II
• Existence of efficient total dominating sets of circulant graphs of degree 4
• scientific article; zbMATH DE number 5914896 (Why is no real title available?)
• Efficient open domination in digraphs
• The complexity of two graph orientation problems
• Directed domination in oriented graphs
• scientific article; zbMATH DE number 637310 (Why is no real title available?)
• scientific article; zbMATH DE number 1161338 (Why is no real title available?)
• scientific article; zbMATH DE number 1409189 (Why is no real title available?)

This page was built for publication: Graph orientation and its total efficient domination

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