Volume 8
n° 1 (2006), pp. 57-64| author: | M. Kouider and P.D. Vestergaard |
|---|---|
| title: | Generalized connected domination in graphs |
| keywords: | connected domination, domination, tree |
| abstract: | As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ of such a smallest set we relate to c k (G)γ , the order
of a smallest connected dominating set.
For a tree c (G)T we give bounds on γ in terms of
minimum valency and diameter.
For trees the inequality c k (T)γ is known to
hold, we determine the class of trees, for which equality holds.c k (T)≤ n-k-1 |
| If your browser does not display the abstract correctly (because of the different mathematical symbols) you may look it up in the PostScript or PDF files. | |
| reference: | M. Kouider and P.D. Vestergaard (2006), Generalized connected domination in graphs, Discrete Mathematics and Theoretical Computer Science 8, pp. 57-64 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm080104.ps.gz (69 K) |
| ps-source: | dm080104.ps (167 K) |
| pdf-source: | dm080104.pdf (166 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.
Automatically produced on Thu Feb 9 21:30:23 CET 2006 by falk