𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kernels in a special class of digraphs

✍ Scribed by H. Galeana-Sánchez; Xueliang Li


Book ID
108316221
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
421 KB
Volume
178
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


About quasi-kernels in a digraph
✍ H. Jacob; H. Meyniel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 122 KB

We generalize a result by Maghout who had shown that every tournament of radius 2 admits three distinct centers. Here we prove that every graph without kernel has at least three distinct quasi-kernels.

On the number of quasi-kernels in digrap
✍ 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

Factors in a class of regular digraphs
✍ M. V. S. Ramanath 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

For the class of 2-diregular digraphs: (1) We give a simple closed form expression-a power of 2-for the number of difactors. (2) For the adjacency matrices of these graphs, we show an intimate relationship between the permanent and determinant. (3) We give a necessary and sufficient condition for th

On the existence of (k, l)-kernels in di
✍ Hortensia Galeana-Sánchez 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 264 KB

In this paper we present some results on the existence of /c-kernels and (k, [)-kernels in digraphs which generalize the following Theorem of P. Duchet [2]: "If every directed cycle of odd length in a digraph D has at least two symmetrical arcs, then D has a kernel.