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] (1997)
- Volume: 4, Issue: 1, page Research paper R26, 25 p.-Research paper R26, 25 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topClark, W.Edwin, and 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] 4.1 (1997): Research paper R26, 25 p.-Research paper R26, 25 p.. <http://eudml.org/doc/119218>.
@article{Clark1997,
author = {Clark, W.Edwin, Dunning, Larry A.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {domination number},
language = {eng},
number = {1},
pages = {Research paper R26, 25 p.-Research paper R26, 25 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Tight upper bounds for the domination numbers of graphs with given order and minimum degree.},
url = {http://eudml.org/doc/119218},
volume = {4},
year = {1997},
}
TY - JOUR
AU - Clark, W.Edwin
AU - Dunning, Larry A.
TI - Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1997
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 4
IS - 1
SP - Research paper R26, 25 p.
EP - Research paper R26, 25 p.
LA - eng
KW - domination number
UR - http://eudml.org/doc/119218
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.