An efficient algorithm for generating transmission irregular trees
Ivan Sto\v{s}i\'c, Ivan Damnjanovi\'c
TL;DR
This paper introduces an efficient algorithm to generate all transmission irregular trees of a given size, ensuring each tree has unique transmission properties, which is useful for graph theory and network analysis.
Contribution
The paper presents a novel, efficient algorithm for generating all non-isomorphic transmission irregular trees of a specified order.
Findings
Algorithm successfully generates all transmission irregular trees up to a given size
The method ensures no isomorphic duplicates are produced
The approach improves computational efficiency over previous methods
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.