✦ LIBER ✦

Edge domatic numbers of complete n- partite graphs

✍ Scribed by Shiow-Fen Hwang; Gerard J. Chang

Publisher: Springer Japan
Year: 1994
Tongue: English
Weight: 575 KB
Volume: 10
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf02986672

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge domination in complete partite grap

Edge domination in complete partite graphs

✍ Bor-Liang Chen; Hung-Lin Fu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 416 KB

An edge dominating set in a graph G is a set of edges D such that every edge not in D is adjacent to an edge of D. An edge domatic partition of a graph C=(V, E) is a collection of pairwise-disjoint edge dominating sets of G whose union is E. The maximum size of an edge domatic partition of G is call

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 domatic number of block-cactus graph

The domatic number of block-cactus graphs

✍ Dieter Rautenbach; Lutz Volkmann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 449 KB

The {k}-domatic number of a graph

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

Total chromatic number of complete r-par

Total chromatic number of complete r-partite graphs

✍ K. H. Chew; H. P. Yap 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB 👁 1 views

## Abstract Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete __r__‐partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete __r__‐partite graph. Rosenfeld's result had been generalized recently to complete __r__‐par

Two characterizations of interchange gra

Two characterizations of interchange graphs of complete m-partite graphs

✍ Curtis R. Cook 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 564 KB

A graph G is m-partite if its points can be partitioned into m subsets Yl, . . . . Vm such that every line joins a point in Vi with a point in Vi, i + j. A complete m-partite graph contains every line joining Vi with V-. A complete graph Kp has every pair of its p points adjacent. The nth interchang