New methods for calculating the degree distance and the Gutman index
From MaRDI portal
Publication:5159174
Abstract: In the paper we develop new methods for calculating the two well-known topological indices, the degree-distance and the Gutman index. Firstly, we prove that the Wiener index of a double vertex-weighted graph can be computed from the Wiener indices of weighted quotient graphs with respect to a partition of the edge set that is coarser than -partition. This result immediately gives a method for computing the degree-distance of any graph. Next, we express the degree-distance and the Gutman index of an arbitrary phenylene by using its hexagonal squeeze and inner dual. In addition, it is shown how these two indices of a phenylene can be obtained from the four quotient trees. Furthermore, reduction theorems for the Wiener index of a double vertex-weighted graph are presented. Finally, a formula for computing the Gutman index of a partial Hamming graph is obtained.
Recommendations
- Generalized cut method for computing the edge-Wiener index
- The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
- Degree distance and Gutman index of two graph products
- Computing Zagreb, Hyper-Wiener and Degree-Distance indices of four new sums of graphs
- Generalizations of some topological indices
Cited in
(6)- Generalized cut method for computing the edge-Wiener index
- Computing the Mostar index in networks with applications to molecular graphs
- Gutman index -- a critical personal account
- Extremal General Gutman Index of Trees
- Extremal general Gutman index of unicyclic graphs with given girth k
- Minimum general Gutman index of trees with a given diameter
This page was built for publication: New methods for calculating the degree distance and the Gutman index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5159174)