On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
From MaRDI portal
(Redirected from Publication:506453)
Recommendations
- Coordination in multiagent systems and Laplacian spectra of digraphs
- On consensus of star-composed networks with an application of Laplacian spectrum
- Laplacian spectrum of a family of recursive trees and its applications in network coherence
- Coherence in a family of tree networks with an application of Laplacian spectrum
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
Cites work
- A projection technique for partitioning the nodes of a graph
- Agreement over random networks
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Distributed consensus in multi-vehicle cooperative control. Theory and applications.
- Eigenvalues and degeneracies for n-dimensional tensor spherical harmonics
- scientific article; zbMATH DE number 426360 (Why is no real title available?)
- scientific article; zbMATH DE number 3889718 (Why is no real title available?)
- scientific article; zbMATH DE number 3871421 (Why is no real title available?)
- scientific article; zbMATH DE number 3891429 (Why is no real title available?)
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 510844 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3349875 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Information Flow and Cooperative Control of Vehicle Formations
- Laplacian eigenvalues and the maximum cut problem
- Laplacian matrices of graphs: A survey
- Old and new results on algebraic connectivity of graphs
- On the spectra of nonsymmetric Laplacian matrices
- Optimal linear labelings and eigenvalues of graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Solving the max-cut problem using eigenvalues
- Spectral partitioning works: planar graphs and finite element meshes
- The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs
- The Eigenvalues of a Graph and Its Chromatic Number
- The Laplacian of a uniform hypergraph
Cited in
(5)- Coordination in multiagent systems and Laplacian spectra of digraphs
- On consensus of star-composed networks with an application of Laplacian spectrum
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra
- Maximizing the smallest eigenvalue of grounded Laplacian matrix
This page was built for publication: On Laplacian spectra of parametric families of closely connected networks with application to cooperative control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506453)
