On strong digraphs with a unique minimally strong subdigraph
โ Scribed by Richard A. Brualdi; Rachel Manber
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 659 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we determine the maximum number of &ges that a strong digraph can have if it has a unique minimally stroug subdigraph. We show that this number equais lrils = I)/2 + 1. Furthermore we show that there is, &to an isomorphism, a unique strong &graph which attains this maximum.
๐ SIMILAR VOLUMES
In his survey article [3] Nash Williams gives a list of unsolved problems. The last problem is the following. Let an (n, ~>q)-digraph denote a digraph without loops and parallel directed edges on a set of n vertices such that the outdegree of every vertex is at least q. If D is an (m + n, >~q + r)-
The a!ect of high-frequency excitation on the low-frequency motions of dynamic systems is considered. It is suggested to di!erentiate between weak, strong and very strong highfrequency excitations. Several approaches and di$culties connected with the analysis of these systems are shown. Systems with