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

The generalized road coloring problem and periodic digraphs

โœ Scribed by G. Budzban; Ph. Feinsilver

Publisher
Springer
Year
2010
Tongue
English
Weight
169 KB
Volume
22
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The recognition of indifference digraphs
The recognition of indifference digraphs and generalized semiorders
โœ Steiner, George ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 434 KB ๐Ÿ‘ 2 views

A digraph is an interval digraph if each vertex can be assigned a source interval and a sink interval on the real line such that there is an edge from u to u if and only if the source interval for u intersects the sink interval for u . A digraph is an indifference digraph or unit interval digraph if