Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2203.00090 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917672760901632 |
|---|---|
| author | Damnjanović, Ivan |
| author_facet | Damnjanović, Ivan |
| contents | We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a rooted tree. Afterwards, two mathematical formulas are given which show how the characteristic polynomials of the adjacency and Laplacian matrix can be represented as products of the aforementioned rational functions. In order to demonstrate their general use case scenario, the obtained formulas are subsequently implemented on balanced trees, with a special focus on the Bethe trees. In the end, some of the previously derived results are used in order to construct a tree merging procedure which preserves the spectra of all of the starting trees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2203_00090 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Assigned rational functions of a rooted tree Damnjanović, Ivan Combinatorics We investigate the spectral properties of rooted trees with the intention of improving the currently existing results that deal with this matter. The concept of an assigned rational function is recursively defined for each vertex of a rooted tree. Afterwards, two mathematical formulas are given which show how the characteristic polynomials of the adjacency and Laplacian matrix can be represented as products of the aforementioned rational functions. In order to demonstrate their general use case scenario, the obtained formulas are subsequently implemented on balanced trees, with a special focus on the Bethe trees. In the end, some of the previously derived results are used in order to construct a tree merging procedure which preserves the spectra of all of the starting trees. |
| title | Assigned rational functions of a rooted tree |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2203.00090 |