Digraphs with highest Hamiltonicity exponent

Rok, strany: 1999, 23 - 34

For a strongly connected digraph $D$ on $n≥ 2$ vertices, the Hamiltonicity exponent $e_H(D)$ — i.e., the least integer $k≥ 1$ such that $D^k$ is Hamiltonian — is at most $lceil((n) / (2)) ceil$. In this paper the digraphs $D$ with $e_H(D) = lceil((n) / (2)) ceil$ are characterized in the open case that $n$ is even.

ISO 690:

Marczyk, A., Schaar, G. 1999. Digraphs with highest Hamiltonicity exponent. In Tatra Mountains Mathematical Publications, vol. 18, no.4, pp. 23-34. 1210-3195.

APA:

Marczyk, A., Schaar, G. (1999). Digraphs with highest Hamiltonicity exponent. Tatra Mountains Mathematical Publications, 18(4), 23-34. 1210-3195.