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...
Збережено в:
| Автор: | |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
IEEE
2023-01-01
|
| Серія: | IEEE Access |
| Предмети: | |
| Онлайн доступ: | https://ieeexplore.ieee.org/document/10313267/ |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|