✦ LIBER ✦

Bounds on thek-tuple domatic number of a graph

✍ Scribed by Lutz Volkmann

Book ID: 111493199
Publisher: SP Versita
Year: 2011
Tongue: English
Weight: 134 KB
Volume: 61
Category: Article
ISSN: 0139-9918
DOI: 10.2478/s12175-011-0052-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Signed total domatic number of a graph

✍ Mei Guan; Er-fang Shan 📂 Article 📅 2008 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 131 KB

The {k}-domatic number of a graph

✍ D. Meierling; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 180 KB

The Romank-domatic number of a graph

✍ Seyed Mahmoud Sheikholeslami; Lutz Volkmann 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 197 KB

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

Signed star domatic number of a graph

✍ M. Atapour; S.M. Sheikholeslami; A.N. Ghameshlou; L. Volkmann 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 366 KB