Convexity of minimal total dominating functions in graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199704)24:4<313::AID-JGT3>3.0.CO;2-R" /><313::AID-JGT3>3.0.CO;2-R 10.1002/(SICI)1097-0118(199704)24:4<313::AID-JGT3>3.0.CO;2-RzbMath0876.05048OpenAlexW4249498471MaRDI QIDQ3129830

Bo Yu

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199704)24:4<313::aid-jgt3>3.0.co;2-r

zbMATH Keywords

total dominating functiontotal dominating sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

A characterisation of universal minimal total dominating functions in trees ⋮ Signed total domination in graphs.

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