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...

Description complète

Détails bibliographiques

Auteur principal:	Gianfranco Parlangeli
Format:	Artigo
Langue:	Inglês
Publié:	IEEE 2023-01-01
Collection:	IEEE Access
Sujets:	Laplacian eigenvalue allocation consensus networks tree graphs spectral graph theory
Accès en ligne:	https://ieeexplore.ieee.org/document/10313267/
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!