An efficient algorithm for generating transmission irregular trees
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917279922388992 |
|---|---|
| author | Stošić, Ivan Damnjanović, Ivan |
| author_facet | Stošić, Ivan Damnjanović, Ivan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_15453 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An efficient algorithm for generating transmission irregular trees Stošić, Ivan Damnjanović, Ivan Discrete Mathematics Combinatorics 68R10, 68R05, 05C12, 05C05 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. |
| title | An efficient algorithm for generating transmission irregular trees |
| topic | Discrete Mathematics Combinatorics 68R10, 68R05, 05C12, 05C05 |
| url | https://arxiv.org/abs/2502.15453 |