On a problem concerning $k$-subdomination numbers of graphs
Czechoslovak Mathematical Journal, Tome 53 (2003) no. 3, pp. 627-629
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
One of numerical invariants concerning domination in graphs is the $k$-subdomination number $\gamma ^{-11}_{kS}(G)$ of a graph $G$. A conjecture concerning it was expressed by J. H. Hattingh, namely that for any connected graph $G$ with $n$ vertices and any $k$ with $\frac{1}{2} n k \leqq n$ the inequality $\gamma ^{-11}_{kS}(G) \leqq 2k - n$ holds. This paper presents a simple counterexample which disproves this conjecture. This counterexample is the graph of the three-dimensional cube and $k=5$.
Classification :
05C69
Keywords: $k$-subdomination number of a graph; three-dimensional cube graph
Keywords: $k$-subdomination number of a graph; three-dimensional cube graph
@article{CMJ_2003__53_3_a10,
author = {Zelinka, Bohdan},
title = {On a problem concerning $k$-subdomination numbers of graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {627--629},
publisher = {mathdoc},
volume = {53},
number = {3},
year = {2003},
mrnumber = {2000058},
zbl = {1080.05526},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2003__53_3_a10/}
}
Zelinka, Bohdan. On a problem concerning $k$-subdomination numbers of graphs. Czechoslovak Mathematical Journal, Tome 53 (2003) no. 3, pp. 627-629. http://geodesic.mathdoc.fr/item/CMJ_2003__53_3_a10/