Comments on On multi-consensus and almost equitable graph partitions

doi:10.1016/j.automatica.2024.111771

Comments on On multi-consensus and almost equitable graph partitions

2024-09-01

0

PRE

AI

DOI：10.1016/j.automatica.2024.111771

原文链接

原文求助

摘要

En 中文

The main theorem of the quoted paper (Theorem 1) claims that the coarsest almost equitable partition (AEP) and clusters of multi-consensus are necessary and sufficient condition for each other. Unfortunately, the sufficiency is not. This correspondence provides a counterexample to that theorem and points out a logical flaw in its proof. (c) 2024 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

Keyword:

Multi-consensus

Multi-agent systems

Almost equitable partitions

Algebraic graph theory

Comments on On multi-consensus and almost equitable graph partitions

摘要

期刊

机构

引用论文