  This paper introduces a novel approach of clustering, which is based on group
consensus of dynamic linear high-order multi-agent systems. The graph topology
is associated with a selected multi-agent system, with each agent corresponding
to one vertex. In order to reveal the cluster structure, the agents belonging
to a similar cluster are expected to aggregate together. As theoretical
foundation, a necessary and sufficient condition is given to check the group
consensus. Two numerical instances are shown to illustrate the process of
approach.
