✦ LIBER ✦

A note on the number of functional digraphs

✍ Scribed by Ronald C. Read

Publisher: Springer
Year: 1961
Tongue: English
Weight: 78 KB
Volume: 143
Category: Article
ISSN: 0025-5831
DOI: 10.1007/bf01342974

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of functional digraphs

✍ Frank Harary 📂 Article 📅 1959 🏛 Springer 🌐 English ⚖ 536 KB

A note concerning paths and independence

A note concerning paths and independence number in digraphs

✍ Geňa Hahn; Bill Jackson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 169 KB

We show that there exist digraphs D such that for all paths P, and P2 we have cu(D \(P, U PJ) = a(D) and point to a generalization.

A note on nonisomorphic cospectral digra

A note on nonisomorphic cospectral digraphs

✍ V Krishnamoorthy; K.R Parthasarathy 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 75 KB

On the number of labeled acyclic digraph

On the number of labeled acyclic digraphs

✍ V.I. Rodionov 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 153 KB

The dichromatic number of a digraph

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

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