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.05169OpenAlexW2075485392MaRDI QIDQ967362
Johannes H. Hattingh, Michael A. Henning
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
Related Items (2)
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number ⋮ Connected Domination
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bounds relating the weakly connected domination number to the total domination number and the matching number