Tight upper bounds for the domination numbers of graphs with given order and minimum degree
The electronic journal of combinatorics, Tome 4 (1997) no. 1
Let $\gamma(n,\delta)$ denote the maximum possible domination number of a graph with $n$ vertices and minimum degree $\delta$. Using known results we determine $\gamma(n,\delta)$ for $\delta = 0, 1, 2, 3$, $n \ge \delta + 1$ and for all $n$, $\delta$ where $\delta = n-k$ and $n$ is sufficiently large relative to $k$. We also obtain $\gamma(n,\delta)$ for all remaining values of $(n,\delta)$ when $n \le 14$ and all but 6 values of $(n,\delta)$ when $n = 15$ or 16.
@article{10_37236_1311,
author = {W. Edwin Clark and Larry A. Dunning},
title = {Tight upper bounds for the domination numbers of graphs with given order and minimum degree},
journal = {The electronic journal of combinatorics},
year = {1997},
volume = {4},
number = {1},
doi = {10.37236/1311},
zbl = {0884.05057},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1311/}
}
TY - JOUR AU - W. Edwin Clark AU - Larry A. Dunning TI - Tight upper bounds for the domination numbers of graphs with given order and minimum degree JO - The electronic journal of combinatorics PY - 1997 VL - 4 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.37236/1311/ DO - 10.37236/1311 ID - 10_37236_1311 ER -
%0 Journal Article %A W. Edwin Clark %A Larry A. Dunning %T Tight upper bounds for the domination numbers of graphs with given order and minimum degree %J The electronic journal of combinatorics %D 1997 %V 4 %N 1 %U http://geodesic.mathdoc.fr/articles/10.37236/1311/ %R 10.37236/1311 %F 10_37236_1311
W. Edwin Clark; Larry A. Dunning. Tight upper bounds for the domination numbers of graphs with given order and minimum degree. The electronic journal of combinatorics, Tome 4 (1997) no. 1. doi: 10.37236/1311
Cité par Sources :