Graph Weight Allocation to Meet Laplacian Spectral Constraints

DOI10.1109/TAC.2011.2181795MaRDI QIDQ5352896zbMATH OpenFDO

Authors

Publication date 8 September 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2011.2181795

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Programming involving graphs or networks (90C35) Eigenvalue problems (93B60)

Cited in

(6)

• Efficient identification of link importance in dynamic networks
• Indiscernible topological variations in DAE networks
• Cooperative tracking control of single-integrator multi-agent systems with multiple leaders
• On the game p-Laplacian on weighted graphs with applications in image processing and data clustering
• Spectrum Consistent Coarsening Approximates Edge Weights
• Distributed optimization of finite condition number for Laplacian matrix in multi-agent systems

This page was built for publication: Graph Weight Allocation to Meet Laplacian Spectral Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352896)