𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The domatic number of block-cactus graphs

✍ Scribed by Dieter Rautenbach; Lutz Volkmann

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
449 KB
Volume
187
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Roman domatic number of a graph
The Roman domatic number of a graph
✍ S.M. Sheikholeslami; L. Volkmann πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 268 KB

A Roman dominating function on a graph G is a labeling f : V (G) -β†’ {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. A set { f 1 , f 2 , . . . , f d } of Roman dominating functions on G with the property that called a Roman dominating family (of functions) on G. The maximu

The {k}-domatic number of a graph
The {k}-domatic number of a graph
✍ D. Meierling; S. M. Sheikholeslami; L. Volkmann πŸ“‚ Article πŸ“… 2011 πŸ› Springer 🌐 English βš– 180 KB
The ratio of the irredundance number and
The ratio of the irredundance number and the domination number for block-cactus graphs
✍ Zverovich, V. E. πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 96 KB πŸ‘ 2 views

Let Ξ³(G) and ir(G) denote the domination number and the irredundance number of a graph G, respectively. Allan and Laskar [Proc. 9th Southeast Conf. on Combin., Graph Theory & Comp. (1978) 43-56] and BollobΓ‘s and Cock- ayne [J. Graph Theory (1979) 241-249] proved independently that Ξ³(G) < 2ir(G) for

Nordhaus–Gaddum bounds on the -rainbow d
Nordhaus–Gaddum bounds on the -rainbow domatic number of a graph
✍ D. Meierling; S.M. Sheikholeslami; L. Volkmann πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 212 KB

For a positive integer k, a k-rainbow dominating function of a graph G is a function f from the vertex set V (G) to the set of all subsets of the set {1, 2, . . . , k} such that for any vertex rainbow dominating family (of functions) on G. The maximum number of functions in a k-rainbow dominating f