CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY
From MaRDI portal
Publication:4288047
DOI10.1080/16073606.1993.9631739zbMATH Open0793.05118OpenAlexW2020394919MaRDI QIDQ4288047FDOQ4288047
Authors: E. J. Cockayne, Christina M. Mynhardt
Publication date: 21 April 1994
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/16073606.1993.9631739
Recommendations
Cites Work
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Title not available (Why is that?)
- Domination, independent domination, and duality in strongly chordal graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computational complexity of upper fractional domination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Title not available (Why is that?)
- Topological properties of the set of all minimal dominating functions of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convexity of minimal dominating functions of trees. II
- Convexity of minimal dominating functions and minimal edge dominating functions
- Convexity of minimal total dominating functions in graphs
This page was built for publication: CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4288047)