On multi-consensus and almost equitable graph partitions
type: Item
instance of: scholarly article
title: On multi-consensus and almost equitable graph partitions
zbMATH Open document ID: 1415.93025
author: Salvatore Monaco
author: Lorenzo Ricciardi Celsi
published in: Automatica
publication date: 2019-04-24T00:00:00Z
full work available at URL: http://hdl.handle.net/11573/1334095
Mathematics Subject Classification ID: 93A14
Mathematics Subject Classification ID: 68T42
Mathematics Subject Classification ID: 93D99
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 7047174
zbMATH Keywords: multi-consensus
zbMATH Keywords: multi-agent systems
zbMATH Keywords: almost equitable partitions
zbMATH Keywords: algebraic graph theory
MaRDI profile type: Publication
OpenAlex ID: W2912352567
cites work: Emergence and evolution of multiple clusters of attracting agents
cites work: On the spectra of nonsymmetric Laplacian matrices
cites work: Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications
cites work: Laplacian eigenvectors and eigenvalues and almost equitable partitions
cites work: Kernels of directed graph Laplacians
cites work: On the cluster consensus of discrete-time multi-agent systems
cites work: Convergence of Infinite Products of Stochastic Matrices: A Graphical Decomposition Criterion
cites work: Coordination of groups of mobile autonomous agents using nearest neighbor rules
cites work: Multi-consensus of nonlinearly networked multi-agent systems
cites work: Q3580272
cites work: Disturbance decoupling problem for multi-agent systems: a graph topological approach
cites work: Stability of multiagent systems with time-dependent communication links
cites work: Discrete-Time Selfish Routing Converging to the Wardrop Equilibrium
cites work: Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
cites work: Graph partitions and cluster synchronization in networks of oscillators
cites work: Group consensus in multi-agent systems with switching topologies and communication delays
cites work: Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
DOI: 10.1016/J.AUTOMATICA.2019.01.021
description: scientific article; zbMATH DE number 7047174