Let D be a strongly k-connected digraph of order n/> 2. We prove that for every l >i n/2k the power D t of D is Hamiltonian. Moreover, for any k >/1 and n > 2k we exhibit a strongly k-connected digraph D of order n such that D rn/2kl-1 is non-Hamiltonian. We use standard terminology, unless otherwi
On the Hamiltonicity exponent of directed cacti
✍ Scribed by Günter Schaar
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 532 KB
- Volume
- 164
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
For a digraph G, the kth power G k can be defined in a similar way as in the case of undirected graphs. If G is finite and strongly connected, en(G) := min{k : G k is Hamiltonian} is called the Hamiltonicity exponent of G; analogously, further exponents--for instance, the Hamiltonian connectedness exponent enc(G)--can be introduced. In order to get nontrivial upper bounds for these exponents it is sensible to consider appropriate subclasses of strongly connected digraphs. In this paper some problems of this kind are treated for directed cacti, i.e. finite strongly connected digraphs every edge of which is contained in at most one directed cycle. Especially, we give a characterization of unicyclic directed cacti G fulfilling ell(G)<<, 2.
📜 SIMILAR VOLUMES
Among the cacti with n vertices and k cycles we determine a unique cactus whose least eigenvalue is minimal. We also explore cacti with n vertices and among them, we find a unique cactus whose least eigenvalue is minimal.
## On the decay exponent of isotropic turbulence It has long been observed that after a short initial transient period of time the decay of the velocity fluctuations u 2 of high Reynolds number homogeneous isotropic turbulence follows closely the algebraic law u 2 ∼ t -n . From experiments and DNS