✦ LIBER ✦

On the number of labeled acyclic digraphs

✍ Scribed by V.I. Rodionov

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 153 KB
Volume: 105
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90155-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On labeled vertex-transitive digraphs wi

On labeled vertex-transitive digraphs with a prime number of vertices

✍ Chong-Yun Chao; Jacqueline G. Wells 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 481 KB

## We enumerate, up to isomorphism, several classes of labeled vertex-transitive digraphs with a prime number of vertices. There are many unsolvedi enumeration problems stated in [S]. Recently, Robinson in [8] posed more enumeration problems. Here, we give some partial answer to the problems posed

On the number of quasi-kernels in digrap

On the number of quasi-kernels in digraphs

✍ Gregory Gutin; Khee Meng Koh; Eng Guan Tay; Anders Yeo 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

## Abstract A vertex set __X__ of a digraph __D__ = (__V, A__) is a __kernel__ if __X__ is independent (i.e., all pairs of distinct vertices of __X__ are non‐adjacent) and for every __v__ ∈ __V__‐__X__ there exists __x__ ∈ __X__ such that __vx__ ∈ __A__. A vertex set __X__ of a digraph __D__ = (__V

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 dichromatic number of a digraph

✍ V Neumann-Lara 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 321 KB

An upper bound on the path number of a d

An upper bound on the path number of a digraph

✍ Richard C O'Brien 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 431 KB

The circular chromatic numbers of planar

The circular chromatic numbers of planar digraphs

✍ Chin-Ann Soh 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 1 views

## Abstract The circular chromatic number is a refinement of the chromatic number of a graph. It has been established in [3,6,7] that there exists planar graphs with circular chromatic number __r__ if and only if __r__ is a rational in the set {1} ∪ [2,4]. Recently, Mohar, in [1,2] has extended the