Universal minimal total dominating functions in graphs

DOI10.1002/NET.3230240205zbMATH Open0804.90122OpenAlexW2140634195MaRDI QIDQ4285459FDOQ4285459

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

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

zbMATH Keywords

total dominating functionconvex combinationsuniversal MTDF in a graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)

Cited In (12)

• Title not available (Why is that?)
• Existence of 0-1 universal minimal total dominating functions
• On the computational complexity of upper total domination
• Universal minimal total dominating functions of trees
• Signed total domination in graphs.
• Structure of the set of all minimal total dominating functions of some classes of graphs
• A characterisation of universal minimal total dominating functions in trees
• Some results on universal minimal total dominating functions
• EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS
• Total dominating functions in trees: Minimality and convexity
• Topological properties of the set of all minimal total dominating functions of a graph
• 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)