✦ LIBER ✦

On domination numbers of graph bundles

✍ Scribed by Blaz Zmazek; Janez Zerovnik

Publisher: Springer-Verlag
Year: 2006
Tongue: English
Weight: 265 KB
Volume: 22
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02896459

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Isoperimetric numbers of graph bundles

✍ Jin Ho Kwak; Jaeun Lee; Moo Young Sohn 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 712 KB

On graphs whose domination numbers equal

On graphs whose domination numbers equal their independent domination numbers

✍ Belmannu Devadas Acharya; Purnima Gupta 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 185 KB

The chromatic numbers of graph bundles o

The chromatic numbers of graph bundles over cycles

✍ Sandi Klavẑar; Bojan Mohar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 565 KB

Graph bundles generalize the notion of covering graphs and products of graphs. The chromatic numbers of product bundles with respect to the Cartesian, strong and tensor product whose base and fiber are cycles are determined. ## 1. Introduction If G is a graph, V(G) and E(G) denote its vertex and e

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

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that