A linear Vizing‐like relation relating the size and total domination number of a graph
- 8 April 2005
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 49 (4) , 285-290
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Maximum sizes of graphs with given domination parametersDiscrete Mathematics, 2004
- Some remarks on dominationJournal of Graph Theory, 2004
- Graphs with large total domination numberJournal of Graph Theory, 2000
- Total domination in graphs with minimum degree threeJournal of Graph Theory, 2000
- On the number of edges in graphs with a given connected domination numberDiscrete Mathematics, 2000
- A linear vizing-like relation between the size and the domination number of a graphJournal of Graph Theory, 1999
- A generalization of Vizing's theorem on dominationDiscrete Mathematics, 1994
- Maximum number of edges in connected graphs with a given domination numberDiscrete Mathematics, 1991
- Total domination in graphsNetworks, 1980