Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Clark, W.Edwin ; Dunning, Larry A.
The Electronic Journal of Combinatorics [electronic only], Tome 4 (1997), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1997-01-01
EUDML-ID : urn:eudml:doc:119218 
@article{01118010,
     title = {Tight upper bounds for the domination numbers of graphs with given order and minimum degree.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {4},
     year = {1997},
     zbl = {0884.05057},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01118010}
}

Clark, W.Edwin; Dunning, Larry A. Tight upper bounds for the domination numbers of graphs with given order and minimum degree.. The Electronic Journal of Combinatorics [electronic only], Tome 4 (1997) . http://gdmltest.u-ga.fr/item/01118010/