Study of graph invariants and parameters

Abstract

This thesis is mainly about the marker set distance and its properties. Cluster newlineidentification is an important operation in electrical networks, data analysis, protein structures and so on. This has been the motivation for defining marker set distance in graphs. Further, the corresponding matrix, the associated characteristic polynomial, its eigenvalues and energy have very interesting properties which we have explored. The thesis consists of nine Chapters in which our research work has been described. We now give a basic outline of the Chapter.