𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Choices and kernels in bipolar valued digraphs

✍ Scribed by Raymond Bisdorff; Marc Pirlot; Marc Roubens

Book ID
108116995
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
225 KB
Volume
175
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disjoint quasi-kernels in digraphs
Disjoint quasi-kernels in digraphs
✍ Scott Heard; Jing Huang πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 126 KB

## Abstract A __quasi‐kernel__ in a digraph is an independent set of vertices such that any vertex in the digraph can reach some vertex in the set via a directed path of length at most two. ChvΓ‘tal and LovΓ‘sz proved that every digraph has a quasi‐kernel. Recently, Gutin et al. raised the question o

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