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

On the out-domination and in-domination numbers of a digraph

โœ Scribed by Gary Chartrand; Frank Harary; Bill Quan Yue

Book ID
108316466
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
229 KB
Volume
197-198
Category
Article
ISSN
0012-365X

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

Domination in a digraph and in its rever
Domination in a digraph and in its reverse
โœ Lโ€™udovรญt Niepel; Martin Knor ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 428 KB
On the domination numbers of generalized
On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
โœ Yosuke Kikuchi; Yukio Shibata ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 94 KB

This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graph