Laplacian Eigenvalue Allocation Through Asymmetric Weights in Acyclic Leader-Follower Networks
This paper tackles the eigenvalue allocation problem through an appropriate choice of the edge weights for the class of combinatorially-symmetric Laplacian matrices of acyclic graphs, namely Laplacian matrices showing symmetric zero/nonzero values in its entries according to a tree graph pattern. Th...
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
IEEE
2023-01-01
|
| Rangatū: | IEEE Access |
| Ngā marau: | |
| Urunga tuihono: | https://ieeexplore.ieee.org/document/10313267/ |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|