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

Domination numbers of undirected toroidal mesh

โœ Scribed by Xin Xie; Jun Ming Xu

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2011
Tongue
English
Weight
214 KB
Volume
28
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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 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

On domination numbers of graph bundles
On domination numbers of graph bundles
โœ Blaz Zmazek; Janez Zerovnik ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 265 KB