Abstract
The transmission TrG(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 |TrG(u) ? TrG(v)| = 1 holds for each edge uv ? 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
