Universal minimal total dominating functions in graphs

DOI10.1002/NET.3230240205MaRDI QIDQ4285459zbMATH OpenOpenAlexFDO

Authors E. J. Cockayne, Bo Yu, Christina M. Mynhardt

Publication date 19 January 1995

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230240205

zbMATH Keywords

convex combinationstotal dominating functionuniversal MTDF in a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A characterisation of universal minimal total dominating functions in trees
• Some results on universal minimal total dominating functions
• Convexity of minimal total dominating functions in graphs
• Topological properties of the set of all minimal total dominating functions of a graph
• Universal minimal total dominating functions of trees

Cited in

(13)

• On the computational complexity of upper total domination
• Signed total domination in graphs.
• Universal minimal total dominating functions of trees
• A characterisation of universal minimal total dominating functions in trees
• Existence of 0-1 universal minimal total dominating functions
• Structure of the set of all minimal total dominating functions of some classes of graphs
• Topological properties of the set of all minimal total dominating functions of a graph
• Convexity of minimal total dominating functions in graphs
• Total dominating functions in trees: Minimality and convexity
• scientific article; zbMATH DE number 812078 (Why is no real title available?)
• EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS
• Some results on universal minimal total dominating functions
• Convexity of minimal total dominating functions in graphs

This page was built for publication: Universal minimal total dominating functions in graphs

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