• CLUSTERING CATERPILLAR GRAPH: AN ALGORITHM

ISHWAR BAIDARI*, AJITH HANAGAWADIMATH, H. S. RAMANE

Abstract


A Caterpillar graph C(Pk) is a tree having a chord less path Pk, called the backbone that contains at least one end point of every edge. Edges connecting the leaves with the backbone are called hairs. In a complete caterpillar graph each vertex of its backbone has a nonempty set of hairs denoted by CC(Pk) a complete caterpillar graph with backbone Pk. In this paper we propose a simple and efficient algorithm for clustering caterpillar graph vertex as base.


Keywords


Caterpillar graph, Degree, Vertex, Queue, Cluster, Color.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2021 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter