A set of vertices of a graph
with
the property that each vertex of
is either in the set or is adjacent to a vertex in the set is called a dominating set of
.
If, additionally, the set of vertices induces a connected subgraph of
then the set is a connected
dominating set of
. The
domination number
of
is the smallest number of vertices in a dominating set of
, and the connected
domination number
of
is the smallest number of vertices in a connected dominating set of
. We find
the connected domination numbers for all triangulations of up to thirteen vertices.
For
,
, we find graphs
of order
and
. We also show
that the difference
can be arbitrarily large.
PDF Access Denied
We have not been able to recognize your IP address
216.73.216.70
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.