Extremal results on stepwise transmission irregular graphs

Abstract

The transmission ${\mathrm{Tr}}_G(v)$ of a vertex $v$ of a connected graph $G$ is the sum of distances between $v$ and all other vertices in $G$. $G$ is a stepwise transmission irregular (STI) graph if $|{\mathrm{Tr}}_G(u)-{\mathrm{Tr}}_G(v)|=1$ holds for each edge $uv\in E(G)$. In this paper, extremal results on STI graphs with respect to the size and different metric properties are proved. Two extremal families appear in all the cases, balanced complete bipartite graphs of odd order and the so called odd hatted cycles.