𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On holomorphic domination, I

✍ Scribed by Imre Patyi

Publisher
Elsevier Science
Year
2011
Tongue
French
Weight
129 KB
Volume
135
Category
Article
ISSN
0007-4497

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs with equal domination and inde
On graphs with equal domination and independent domination numbers
✍ Jerzy Topp; Lutz Volkmann πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 284 KB

Topp, J. and L. Volkmann, On graphs wi',h equal domination and independent domination number, Discrete Mathematics 96 (1991) 75-80. Allan and Laskar have shown that Kt.s-free graphs are graphs with equal domination and independent domination numbers. In this paper new classes of graphs with equal d

On domination and independent domination
On domination and independent domination numbers of a graph
✍ Robert B. Allan; Renu Laskar πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 399 KB

For a graph G, the definitions of doknation number, denoted y(G), and independent domination number, denoted i(G), are given, and the following results are obtained: oorollrrg 1. For any graph G, y(L(G)) = i@(G)), where Z,(G) is the line graph of G. (This $xh!s t.lic rtsult ~(L(T))~i(L(T)), h w ere

Some remarks on domination
Some remarks on domination
✍ D. Archdeacon; J. Ellis-Monaghan; D. Fisher; D. Froncek; P.C.B. Lam; S. Seager; πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 49 KB

## Abstract We prove a conjecture of Favaron et al. that every graph of order __n__ and minimum degree at least three has a total dominating set of size at least __n__/2. We also present several related results about: (1) extentions to graphs of minimum degree two, (2) examining graphs where the bo