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

On the distribution of the domination number for random class cover catch digraphs

โœ Scribed by Carey E. Priebe; Jason G. DeVinney; David J. Marchette

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
122 KB
Volume
55
Category
Article
ISSN
0167-7152

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

On a formula for the number of Euler tra
On a formula for the number of Euler trails for a class of digraphs
โœ J Lauri ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 240 KB

In this note we give an elementary combinatorial proof of a formula of Macris and Pul6 for the number of Euler trails in a digraph all of whose vertices have in-degree and out-degree equal to2.

An alternative formula for the number of
An alternative formula for the number of Euler trails for a class of digraphs
โœ N. Macris; J.V. Pulรฉ ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

We derive an alternative formula for the number of Euler trails on strongly connected directed pseudographs whose every vertex has outdegree and indegree both equal to two in terms of an intersection matrix.