𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of noncritical vertices in strongly connected digraphs

✍ Scribed by S. V. Savchenko

Publisher
SP MAIK Nauka/Interperiodica
Year
2006
Tongue
English
Weight
185 KB
Volume
79
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On complete strongly connected digraphs
On complete strongly connected digraphs with the least number of 3-cycles
✍ M. Burzio; J. Pelant πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 186 KB

The least number of 3-cycles (cycles of length 3) that a hamiltonian tournament of order n can contain is n -2 (see [3]). Since each complete strongly connected digraph contains a spanning hamiltonian subtournament (see [2]), n-2 is also the least number of 3-cycles for these digraphs. In this pape

On Vertices of outdegree n in minimally
On Vertices of outdegree n in minimally n-connected digraphs
✍ W. Mader πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 1 views

## Abstract Let |__D__| and |D|^+^~__n__~ denote the number of vertices of __D__ and the number of vertices of outdegree __n__ in the digraph __D__, respectively. It is proved that every minimally __n__‐connected, finite digraph __D__ has |D|^+^~__n__~ β‰₯ __n__ + 1 and that for __n__ β‰₯ 2, there is a

The number of vertices of degree k in a
The number of vertices of degree k in a minimally k-edge-connected digraph
✍ Yuan Xu-dong; Kang Liying; Cai Mao-cheng πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 298 KB πŸ‘ 2 views

Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x ∈ V (D) by δ D (x) and ρ D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul Erdâs is Eigh

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

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