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

Some results on domination number of products of graphs

โœ Scribed by Shan Erfang; Sun Liang; Kang Liying

Book ID
107502111
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
1998
Tongue
English
Weight
224 KB
Volume
13
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the domination number of some graphs
On the domination number of some graphs
โœ Kazemi, Adel P. ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Informa UK (Taylor & Francis) ๐ŸŒ English โš– 174 KB
On the domination number of cross produc
On the domination number of cross products of graphs
โœ Sylvain Gravier; Abdelkader Khelladi ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 195 KB

In this communication the domination number of the cross product of an elementary path with the complement of another path is exactly determined and some inequalities for general cases are deduced. The paper ends with a Vizing-like conjecture relating the domination number of the cross product of G

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