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

On the domination number of some graphs

โœ Scribed by Kazemi, Adel P.

Book ID
120607399
Publisher
Informa UK (Taylor & Francis)
Year
2009
Tongue
English
Weight
174 KB
Volume
12
Category
Article
ISSN
0972-0529

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