๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The k-neighbor, r-domination problems on interval graphs

โœ Scribed by Dipti S. Joshi; Sridhar Radhakrishnan; N. Chandrasekharan

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
981 KB
Volume
79
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The k-neighbor domination problem
The k-neighbor domination problem
โœ Shiow-Fen Hwang; Gerard J. Chang ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 314 KB
r-domination problems on homogeneously o
r-domination problems on homogeneously orderable graphs
โœ Dragan, Feodor F.; Nicolai, Falk ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB ๐Ÿ‘ 2 views

In this paper, we consider r-dominating cliques in homogeneously orderable graphs (a common generalization of dually chordal and distance-hereditary graphs) and their relation to strict r-packing sets. We prove that a homogeneously orderable graph G possesses an r-dominating clique if and only if fo

On the r-domination number of a graph
On the r-domination number of a graph
โœ Jerrold R. Griggs; Joan P. Hutchinson ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 468 KB

For r > 0, let the r-domination number of a graph, d,, be the size of a smallest set of vertices such that every vertex of the graph is within distance r of a vertex in that set. This paper contains proofs that every graph with a spanning tree with at least n/2 leaves has d, s n/(2r); this compares