An efficient algorithm for generating transmission irregular trees
arXiv:2502.15453 · doi:10.1007/s40314-025-03474-7
Abstract
The transmission of a vertex in a connected graph is the sum of distances from that vertex to all the other vertices. A connected graph is transmission irregular if any two distinct vertices have different transmissions. We present an efficient algorithm that generates all the transmission irregular trees up to a given order, up to isomorphism.