























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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。