OAK

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

Metadata Downloads
Abstract
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.
Author(s)
Ma, Jeong-MinPark, Nam-JinLee, Hyung-GonAhn, Hyo-Sung
Issued Date
2024-09
Type
Article
DOI
10.1016/j.automatica.2024.111771
URI
https://scholar.gist.ac.kr/handle/local/9341
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Citation
AUTOMATICA, v.167
ISSN
0005-1098
Appears in Collections:
Department of Mechanical and Robotics Engineering > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.