Bounds relating the weakly connected domination number to the total domination number and the matching number
From MaRDI portal
Publication:967362
DOI10.1016/j.dam.2009.06.008zbMath1209.05169MaRDI QIDQ967362
Michael A. Henning, Johannes H. Hattingh
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.008
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of selected recent results on total domination in graphs
- Connected domination of regular graphs
- On weakly connected domination in graphs
- On the number of edges in graphs with a given weakly connected domination number
- On weakly connected domination in graphs. II.
- A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS