# DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

# IMPACT FACTOR 2018: 0.741

SCImago Journal Rank (SJR) 2018: 0.763

Rejection Rate (2017-2018): c. 84%

# Discussiones Mathematicae Graph Theory

## Hamiltonian-colored Powers of Strong Digraphs

 Garry Johns1, Ryan Jones2, Kyle Kolasinski2 and Ping Zhang2 1 Saginaw Valley State University 2 Western Michigan University

## Abstract

For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d , the kth power Dk of D is that digraph having vertex set V(D) with the property that (u, v) is an arc of Dk if the directed distance dD(u, v) from u to v in D is at most k. For every strong digraph D of order n ≥ 2 and every integer k ≥ #x23a1;n/2 #x23a4;, the digraph Dk is Hamiltonian and the lower bound #x23a1;n/2 #x23a4; is sharp. The digraph Dk is distance-colored if each arc (u, v) of Dk is assigned the color i where i = dD(u, v). The digraph Dk is Hamiltonian-colored if Dk contains a properly arc-colored Hamiltonian cycle. The smallest positive integer k for which Dk is Hamiltonian-colored is the Hamiltonian coloring exponent hce(D) of D. For each integer n ≥ 3, the Hamiltonian coloring exponent of the directed cycle Cn of order n is determined whenever this number exists. It is shown for each integer k ≥ 2 that there exists a strong oriented graph Dk such that hce(Dk) = k with the added property that every properly colored Hamiltonian cycle in the kth power of Dk must use all k colors. It is shown for every positive integer p there exists a a connected graph G with two different strong orientations D and D ′ such that hce(D) −hce(D ′) ≥ p.

Keywords: powers of a strong oriented graph, distance-colored digraphs, Hamiltonian-colored digraphs, Hamiltonian coloring exponents

2010 Mathematics Subject Classification: 05C12, 05C15, 05C20, 05C45.

## References

 [1] G. Chartrand, R. Jones, K. Kolasinski and P. Zhang, On the Hamiltonicity of distance-colored graphs, Congr. Numer. 202 (2010) 195--209. [2] G. Chartrand, K. Kolasinski and P. Zhang, The colored bridges problem, Geographical Analysis 43 (2011) 370--382, doi: 10.1111/j.1538-4632.2011.00827.x. [3] G. Chartrand, L. Lesniak and P. Zhang, Graphs & Digraphs, Fifth Edition (Chapman & Hall/CRC, Boca Raton, FL, 2011). [4] H. Fleischner, The square of every nonseparable graph is Hamiltonian, Bull. Amer. Math. Soc. 77 (1971) 1052--1054, doi: 10.1090/S0002-9904-1971-12860-4. [5] A. Ghouila-Houri, Une condition suffisante d'existence d'un circuit Hamiltonien, C. R. Acad. Sci. Paris 251 (1960) 495--497. [6] R. Jones, K. Kolasinski and P. Zhang, On Hamiltonian-colored graphs, Util. Math. to appear. [7] M. Sekanina, On an ordering of the set of vertices of a connected graph, Publ. Fac. Sci. Univ. Brno 412 (1960) 137--142.