Squared distance matrices of trees with matrix weights
AbstractLet T be a tree on n vertices whose edge weights are positive definite matrices of order s. The squared distance matrix of T, denoted by Δ, is the ns × ns block matrix with [Formula: see text], where d(i, j) is the sum of the weights of the edges in the unique (i, j)-path. In this article, w...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Taylor & Francis Group
2023-05-01
|
| Ráidu: | AKCE International Journal of Graphs and Combinatorics |
| Fáttát: | |
| Liŋkkat: | https://www.tandfonline.com/doi/10.1080/09728600.2023.2236172 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|