optimizing the gutman index: a study of minimum values under transformations of graphs

The extremal gutman index is a concept that studies the maximum or minimum value of the gutman index for a particular class of graphs. this research area is concerned with finding the graphs that have the lowest possible gutman index within a set of graphs that have been transformed in some way, such as by adding or removing edges or vertices. by understanding the graphs that have the lowest possible gutman index, researchers can better understand the fundamental principles of graph stability and the role that different graph transformations play in affecting the overall stability of a graph. the research in this area is ongoing and continues to expand as new techniques and algorithms are developed. the findings from this research have the potential to have a significant impact on a wide range of fields and can lead to new and more effective ways of analyzing and understanding complex systems and relationships in a variety of applications. this paper focuses on the study of specific types of trees that are defined by fixed parameters and characterized based on their gutman index. specifically, we explore the structural properties of graphs that have the lowest gutman index within these classes of trees. to achieve this, we utilize various graph transformations that either decrease or increase the gutman index. by applying these transformations, we construct trees that satisfy the desired criteria.