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

k-Domination andk-Independence in Graphs: A Survey

โœ Scribed by Mustapha Chellali; Odile Favaron; Adriana Hansberg; Lutz Volkmann

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
641 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Generalized independence and domination
Generalized independence and domination in graphs
โœ Mieczysล‚aw Borowiecki; Danuta Michalak ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

The purpose of this paper is to introduce various concepts of g?-domination, which generalize and unify different well-known kinds of domination in graphs. We generalize a result of Lov/tsz concerning the existence of a partition of a set of vertices of G into independent subsets and a result of Fav

Independence and hamiltonicity in 3-domi
Independence and hamiltonicity in 3-domination-critical graphs
โœ Favaron, Odile; Tian, Feng; Zhang, Lei ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 144 KB ๐Ÿ‘ 3 views

Let ฮด, ฮณ, i and ฮฑ be respectively the minimum degree, the domination number, the independent domination number and the independence number of a graph G. The graph G is 3-ฮณ-critical if ฮณ = 3 and the addition of any edge decreases ฮณ by 1. It was conjectured that any connected 3-ฮณ-critical graph satisf

k-tuple domination in graphs
k-tuple domination in graphs
โœ Chung-Shou Liao; Gerard J. Chang ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 109 KB
Independent domination in regular graphs
Independent domination in regular graphs
โœ Julie Haviland ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 387 KB

Let G be a simple graph of order n. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. Motivated by work of Cockayne et al. (1991) and Cockayne and Mynhardt (1989), we investigate the maximum value of the product of th