The main contribution of this paper is to propose a new cluster maintenance algorithm and a companion cluster initialization algorithm based on a number of interesting and novel properties of diameter-2 graphs. The initialization algorithm naturally blends into cluster maintenance, showing the unity between these two operations. We refer to our algorithms as tree-based since they depend on a spanning tree maintained at various nodes. Unlike the vast majority of published clustering algorithms, our algorithms are cluster-centric, as opposed to node-centric, and work in the presence of node mobility. Extensive simulation results have shown the effectiveness of our algorithms when compared to other clustering schemes proposed in the literature.