Comments on "On multi-consensus and almost equitable graph partitions"

被引:0
|
作者
Ma, Jeong-Min [1 ]
Park, Nam-Jin [1 ]
Lee, Hyung-Gon [1 ]
Ahn, Hyo-Sung [1 ]
机构
[1] Gwangju Inst Sci & Technol, Sch Mech Engn, Gwangju 61005, South Korea
基金
新加坡国家研究基金会;
关键词
Multi-consensus; Multi-agent systems; Almost equitable partitions; Algebraic graph theory;
D O I
10.1016/j.automatica.2024.111771
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页数:2
相关论文
共 50 条
  • [1] On multi-consensus and almost equitable graph partitions
    Monaco, Salvatore
    Celsi, Lorenzo Ricciardi
    [J]. AUTOMATICA, 2019, 103 : 53 - 61
  • [2] Authors' reply to 'comments on "On multi-consensus and almost equitable graph partitions"
    Monaco, S.
    Celsi, L. Ricciardi
    [J]. AUTOMATICA, 2024, 167
  • [3] On almost equitable partitions and network controllability
    Aguilar, Cesar O.
    Gharesifard, Bahman
    [J]. 2016 AMERICAN CONTROL CONFERENCE (ACC), 2016, : 179 - 184
  • [4] Controllability of Multi-Agent Networks Based on Almost Equitable Partitions
    Pan, Zhenzhen
    Ji, Zhijian
    Yu, Haisheng
    [J]. PROCEEDINGS OF THE 30TH CHINESE CONTROL AND DECISION CONFERENCE (2018 CCDC), 2018, : 1466 - 1471
  • [5] EPIDEMIC OUTBREAKS IN NETWORKS WITH EQUITABLE OR ALMOST-EQUITABLE PARTITIONS
    Bonaccorsi, S.
    Ottaviano, S.
    Mugnolo, D.
    De Pellegrini, F.
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 2015, 75 (06) : 2421 - 2443
  • [6] Laplacian eigenvectors and eigenvalues and almost equitable partitions
    Cardoso, Domingos M.
    Delorme, Charles
    Rama, Paula
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (03) : 665 - 673
  • [7] Equitable partitions into spanning trees in a graph
    Fekete, Zsolt
    Szabo, Jacint
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [8] Almost equitable partitions and controllability of leader-follower multi-agent systems
    Zhang, Xiufeng
    Sun, Jian
    [J]. AUTOMATICA, 2021, 131
  • [9] Locally constrained graph homomorphisms and equitable partitions
    Fiala, Jiri
    Paulusma, Daniel
    Telle, Jan Arne
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2008, 29 (04) : 850 - 880
  • [10] Consensus and multi-consensus for discrete-time LTI systems☆
    Cacace, Filippo
    Mattioni, Mattia
    Monaco, Salvatore
    Normand-Cyrot, Dorothee
    [J]. AUTOMATICA, 2024, 166