𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On kernels in strongly connected graphs

✍ Scribed by M. Anciaux-Mundeleer; P. Hansen

Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
204 KB
Volume
7
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On kernels in i-triangulated graphs
On kernels in i-triangulated graphs
✍ F Maffray πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 319 KB

A directed graph is said to be kernel-perfect if every induced subgraph possesses a kernel (independent, absorbing subset). A necessary condition for a graph to be kernel-perfect is that every complete subgraph C has an absorbing vertex (i.e., a successor of all vertices of C). In this work, we show

On strongly asymmetric graphs
On strongly asymmetric graphs
✍ Mirko LepoviΔ‡ πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 261 KB

Let G be an arbitrary simple graph of order n. G is called strongly asymmetric if all induced overgraphs of G of order (n + 1) are nonisomorphic. In this paper we give some properties of such graphs and prove that the class 6ec of all connected strongly asymmetric graphs is infinite. In this paper

Kernels in random graphs
Kernels in random graphs
✍ W.Fernandez de la Vega πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 214 KB

For each fixed p, the random directed graph D(n, p) on n vertices with (directed) edge probability p possesses a kernel with probability tending to 1 as n + a. Pour chaque p fixe, le graphe alCatoire D(n, p) a n sommets et probabilitts des arcs Cgales B p posstde un noyau avec une probabilit6 tenda