An efficient algorithm for generating transmission irregular trees
Discrete Mathematics
2026-02-20 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.2502.15453,
title = {An efficient algorithm for generating transmission irregular trees},
author = {Ivan Stošić and Ivan Damnjanović},
journal= {arXiv preprint arXiv:2502.15453},
year = {2026}
}