𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the Distance Two-Domination Number of a Graph

✍ Scribed by N. Sridharan; V.S.A. Subramanian; M.D. Elias

Publisher
Springer Japan
Year
2002
Tongue
English
Weight
122 KB
Volume
18
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds on the -domination number of a gr
Bounds on the -domination number of a graph
✍ Ermelinda DeLaViΓ±a; Wayne Goddard; Michael A. Henning; Ryan Pepper; Emil R. Vaug πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 200 KB

The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove two bounds on the k-domination number of a graph, inspired by two conjectures of the computer program Graffiti.pc. In part

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

Some upper bounds for the product of the
Some upper bounds for the product of the domination number and the chromatic number of a graph
✍ Jerzy Topp; Lutz Volkmann πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 199 KB

Topp, J. and L. Volkmann, Some upper bounds for the product of the domination number and the chromatic number of a graph, Discrete Mathematics 118 (1993) 2899292. Some new upper bounds for yx are proved, where y is the domination number and x is the chromatic number of a graph. All graphs consider