๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

About some cyclic properties in digraphs

โœ Scribed by M.C Heydemann; D Sotteau

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
847 KB
Volume
38
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

About quasi-kernels in a digraph
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.

About the shortest chain between two ver
About the shortest chain between two vertices in a quasi strongly connected digraph with a potential
โœ Jean-Pierre Barthelemy ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 370 KB

A closed form solution is provided for the length, relatively between two vertices of a quasi strongly connected digraph. to a potential Cr, of a chain ## I. Detidtions and nobtion!!i Let G = (V, A) denote a finite connected digraph without loop; V is the set of vertices and A the set of arcs. A

Some remarks on Arc-connectivity, vertex
Some remarks on Arc-connectivity, vertex splitting, and orientation in graphs and digraphs
โœ Bill Jackson ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 309 KB

We apply proof techniques developed by L. Lovasz and A. Frank to obtain several results on the arc-connectivity of graphs and digraphs. The first results concern the operation of splitting two arcs from a vertex of an Eulerian graph or digraph in such a way as to preserve local connectivity conditio