Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.
The Electronic Journal of Combinatorics [electronic only] (2000)
- Volume: 7, Issue: 1, page Research paper R58, 19 p.-Research paper R58, 19 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topClark, W.Edwin, and 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] 7.1 (2000): Research paper R58, 19 p.-Research paper R58, 19 p.. <http://eudml.org/doc/120897>.
@article{Clark2000,
author = {Clark, W.Edwin, Suen, Stephen},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {dominating set; domination number; minimum degree},
language = {eng},
number = {1},
pages = {Research paper R58, 19 p.-Research paper R58, 19 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. II.},
url = {http://eudml.org/doc/120897},
volume = {7},
year = {2000},
}
TY - JOUR
AU - Clark, W.Edwin
AU - Suen, Stephen
TI - Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2000
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 7
IS - 1
SP - Research paper R58, 19 p.
EP - Research paper R58, 19 p.
LA - eng
KW - dominating set; domination number; minimum degree
UR - http://eudml.org/doc/120897
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.