The Gourava indices and hyper-Gourava indices are graph invariants, related to the degree of vert... more The Gourava indices and hyper-Gourava indices are graph invariants, related to the degree of vertices of a graph G . Let T n , b denote the collection of all chemical trees with n vertices where b denotes the number of branching vertices, 1 ≤ b < n − 2 / 2 . In the current paper, maximum value for the abovementioned topological indices for different classes 1 T n , b and 2 T n , b of T n , b is determined and the corresponding extremal trees are characterized.
The Gourava indices and hyper-Gourava indices are introduced by Kulli in 2017. These graph invari... more The Gourava indices and hyper-Gourava indices are introduced by Kulli in 2017. These graph invariants are related to the degree of vertices of a graph G . Let T n , r be the class of all n − vertex chemical trees with r segments. In this paper, we characterize the graphs with the maximum value of the above indices in the class of chemical trees. In addition to different degree sequences, sharp upper bounds on those indices of trees with a fixed number of segments are determined, and the corresponding extremal trees are characterized.
The Gourava indices and hyper-Gourava indices are graph invariants, related to the degree of vert... more The Gourava indices and hyper-Gourava indices are graph invariants, related to the degree of vertices of a graph G . Let T n , b denote the collection of all chemical trees with n vertices where b denotes the number of branching vertices, 1 ≤ b < n − 2 / 2 . In the current paper, maximum value for the abovementioned topological indices for different classes 1 T n , b and 2 T n , b of T n , b is determined and the corresponding extremal trees are characterized.
The Gourava indices and hyper-Gourava indices are introduced by Kulli in 2017. These graph invari... more The Gourava indices and hyper-Gourava indices are introduced by Kulli in 2017. These graph invariants are related to the degree of vertices of a graph G . Let T n , r be the class of all n − vertex chemical trees with r segments. In this paper, we characterize the graphs with the maximum value of the above indices in the class of chemical trees. In addition to different degree sequences, sharp upper bounds on those indices of trees with a fixed number of segments are determined, and the corresponding extremal trees are characterized.
Uploads
Papers by Muzamil Hanif