✦ LIBER ✦

Kernels and partial line digraphs

✍ Scribed by C. Balbuena; M. Guevara

Book ID: 104000923
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 274 KB
Volume: 23
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2010.06.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

(k,l)-kernels in line digraphs

✍ Qin Lu; Er-fang Shan; Min Zhao 📂 Article 📅 2006 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 244 KB

On kernels and semikernels of digraphs

✍ H Galeana-Sánchez; V Neumann-Lara 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 445 KB

A kernel N of a digraph D is an independent set of vertices of D such that for every w ~ V(D)-N there exists an arc from w to N. If every induced subdigraph of D has a kernel, D is said to be an R-digraph. Minimal non-R-digraphs are called R--digraphs. In this paper some structural results concernin

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

Choices and kernels in bipolar valued di

Choices and kernels in bipolar valued digraphs

✍ Raymond Bisdorff; Marc Pirlot; Marc Roubens 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Functions and line digraphs

✍ Amine El Sahili 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

## Abstract Consider two maps __f__ and __g__ from a set __E__ into a set __F__ such that __f__(__x__) ≠ g(__x__) for every __x__ in __E__. Suppose that there exists a positive integer __n__ such that for any element __z__ in __F__ either __f__^−1^(__z__) or __g__^−1^(__z__) has at most __n__ eleme

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