Generalized stepwise transmission irregular graphs

arXiv2306.05699MaRDI QIDQ6439747FDOQ6439747

Authors: Yaser Alizadeh, Sandi Klavžar, Zohre Molaee 

Publication date: 9 June 2023

Abstract: The transmission ${mTr}_G(u)$ of a vertex $u$ of a connected graph $G$ is the sum of distances from $u$ to all other vertices. $G$ is a stepwise transmission irregular (STI) graph if $|{mTr}_G(u)-{mTr}_G(v)|=1$ holds for any edge $uvinE(G)$. In this paper, generalized STI graphs are introduced as the graphs $G$ such that for some $kge1$ we have $|{mTr}_G(u)-{mTr}_G(v)|=k$ for any edge $uv$ of $G$. It is proved that generalized STI graphs are bipartite and that as soon as the minimum degree is at least $2$, they are 2-edge connected. Among the trees, the only generalized STI graphs are stars. The diameter of STI graphs is bounded and extremal cases discussed. The Cartesian product operation is used to obtain highly connected generalized STI graphs. Several families of generalized STI graphs are constructed.

This page was built for publication: Generalized stepwise transmission irregular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6439747)