scientific article; zbMATH DE number 30748

MaRDI QIDQ3987040zbMATH OpenFDO

Authors E. J. Cockayne, Gary MacGillivray, Christina M. Mynhardt

Publication date 28 June 1992

zbMATH Keywords

dominating setfeasible solutionlinear algorithmuniversal dominating function

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A characterisation of universal minimal total dominating functions in trees
• Universal minimal total dominating functions of trees
• A linear algorithm for r, s -domination of a tree
• Minimax trees in linear time with applications
• Minimax Trees in Linear Time with Applications
• Linear algorithms for edge-vertex domination in trees
• Total dominating functions in trees: Minimality and convexity
• A linear time algorithm for minimum equitable dominating set in trees
• On the number of minimum dominating sets in trees
• The minimum dominating tree problem for graphs

Cited in

(6)

• Universal maximal packing functions of graphs
• Universal minimal total dominating functions of trees
• Minimax Trees in Linear Time with Applications
• scientific article; zbMATH DE number 3959487 (Why is no real title available?)
• scientific article; zbMATH DE number 749271 (Why is no real title available?)
• Linear algorithms for edge-vertex domination in trees

This page was built for publication:

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