2 research outputs found
The irregularity of two types of trees
The irregularity of a graph is defined as the sum of weights of all edges of , where and are the degrees of the vertices and in , respectively. In this paper, some structural properties on trees with maximum (or minimum) irregularity among trees with given degree sequence and trees with given branching number are explored, respectively. Moreover, the corresponding trees with maximum (or minimum) irregularity are also found, respectively
The irregularity of two types of trees
The irregularity of a graph is defined as the sum of weights of all edges of , where and are the degrees of the vertices and in , respectively. In this paper, some structural properties on trees with maximum (or minimum) irregularity among trees with given degree sequence and trees with given branching number are explored, respectively. Moreover, the corresponding trees with maximum (or minimum) irregularity are also found, respectively