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

Generalized perfect domination in graphs

โœ Scribed by B. Chaluvaraju, K. A. Vidya

Book ID
120694173
Publisher
Springer US
Year
2012
Tongue
English
Weight
458 KB
Volume
27
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Generalized domination and efficient dom
Generalized domination and efficient domination in graphs
โœ D.W. Bange; A.E. Barkauskas; L.H. Host; P.J. Slater ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 516 KB

This paper generalizes dominating and efficient dominating sets of a graph. Let G be a graph with vertex set V(G). If f: V(G) ~ Y, where Y is a subset of the reals, the weight off is the sum of f(v) over all ve V(G). If the closed neighborhood sum off(v) at every vertex is at least 1, thenfis called

Perfect domination sets in Cayley graphs
Perfect domination sets in Cayley graphs
โœ Kwon, Young Soo; Lee, Jaeun ๐Ÿ“‚ Article ๐Ÿ“… 2014 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB
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