𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of reachable pairs in a digraph

✍ Scribed by A.R. Rao

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
191 KB
Volume
15
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The circular chromatic number of a digra
The circular chromatic number of a digraph
✍ Drago Bokal; GasΜ†per Fijavz; Martin Juvan; P. Mark Kayll; Bojan Mohar πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 1 views

## Abstract We introduce the circular chromatic number Ο‡~__c__~ of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directe

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