Open AccessLower bounds for the domination number
Author(s) -
Ermelinda DeLaViña,
Ryan Pepper,
Bill Waller
Publication year - 2010
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1508
Subject(s) - domination analysis , mathematics , combinatorics , graph , upper and lower bounds , matching (statistics) , simple graph , discrete mathematics , vertex (graph theory) , statistics , mathematical analysis
In this note, we prove several lower bounds on the domination number of simple connected graphs. Among these are the following: the domination number is at least two-thirds of the radius of the graph, three times the domination number is at least two more than the number of cut-vertices in the graph, and the domination number of a ...
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom