EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS

DOI10.1080/16073606.1996.9631840zbMath0849.05043OpenAlexW2026240995MaRDI QIDQ4886301

P. J. P. Grobler, Christina M. Mynhardt

Publication date: 31 July 1996

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1996.9631840

zbMATH Keywords

dominating setdomination numberaggregateneighbourhood0-dominating function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• A characterisation of universal minimal total dominating functions in trees
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Universal minimal total dominating functions in graphs
• Total dominating functions in trees: Minimality and convexity

This page was built for publication: EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS