A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs

A proper total colouring of a graph G is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edgeswith their colours, then no pair of colours appears twice. The smallest number of colours for it to exist is called the harmonious total chromatic number of G, denoted by ht(G). Here, we give a general upper bound for ht(G) in terms of the order n of G. Our two main results are obvious consequences of the computation of the harmonious total chromatic number of the complete graph Kn and of the complete multigraph λKn, where λ is the number of edges joining each pair of vertices of Kn. In particular, Araujo-Pardo et al. have recently shown that 23 n ≤ ht(Kn) ≤ 53 n + θ(1). In this paper, we prove that ht(Kn) = ⌈ 32 n⌉ except for ht(K1) = 1 and ht(K4) = 7; therefore, ht(G) ≤ ⌈ 32 n⌉, for every graph G on n > 4 vertices. Finally, we extend such a result to the harmonious total chromatic number of the complete multigraph λKn and as a consequence show that ht(G) ≤ (λ − 1)(2 ⌈ n2⌉ − 1) + ⌈ 32n⌉ for n > 4, where G is a multigraph such that λ is the maximum number of edges between any two vertices.