๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On edge domination numbers of graphs

โœ Scribed by Baogen Xu

Book ID
108113515
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
166 KB
Volume
294
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some results on characterizing the edges
Some results on characterizing the edges of connected graphs with a given domination number
โœ Laura A. Sanchis ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 821 KB

A dominatin# set for a graph G = (V, E) is a subset of vertices V' c\_ V such that for all v โ€ข V-V' there exists some uโ€ข V' for which {v,u} โ€ขE. The domination number of G is the size of its smallest dominating set(s). For a given graph G with minimum size dominating set D, let mz(G, D) denote the nu

Domination numbers of planar graphs
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

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