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...
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
IEEE
2023-01-01
|
| coleção: | IEEE Access |
| Assuntos: | |
| Acesso em linha: | https://ieeexplore.ieee.org/document/10313267/ |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|