On interval transmission irregular graphs

Abstract

Transmission of a vertex v of a connected graph G is the sum of distances from v to all other vertices in G. Graph G is transmission irregular (TI) if no two of its vertices have the same transmission, and G is interval transmission irregular (ITI) if it is TI and the vertex transmissions of G form a sequence of consecutive integers. Here we give a positive answer to the question of Dobrynin [Appl Math Comput 340 (2019), 1–4] of whether infinite families of ITI graphs exist.