Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.
Clark, W.Edwin ; Suen, Stephen
The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000), / Harvested from The Electronic Library of Mathematics
Publié le : 2000-01-01
EUDML-ID : urn:eudml:doc:120897
@article{01542668,
     title = {Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {7},
     year = {2000},
     zbl = {0959.05086},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01542668}
}
Clark, W.Edwin; Suen, Stephen. Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.. The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000) . http://gdmltest.u-ga.fr/item/01542668/