New methods for calculating the degree distance and the Gutman index

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 $\Theta^*$-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.

[1]  H. Wiener.  Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.

[2]  Harry P. Schultz,et al.  Topological organic chemistry. 1. Graph theory and topological indices of alkanes , 1989, J. Chem. Inf. Comput. Sci..

[3]  Ivan Gutman,et al.  Selected properties of the Schultz molecular topological index , 1994, J. Chem. Inf. Comput. Sci..

[4]  Andrey A. Dobrynin,et al.  Degree Distance of a Graph: A Degree Analog of the Wiener Index , 1994, J. Chem. Inf. Comput. Sci..

[5]  Victor Chepoi,et al.  On Distances in Benzenoid Systems , 1996, J. Chem. Inf. Comput. Sci..

[6]  Sandi Klavzar,et al.  Wiener Number of Vertex-weighted Graphs and a Chemical Application , 1997, Discret. Appl. Math..

[7]  Victor Chepoi,et al.  The Wiener Index and the Szeged Index of Benzenoid Systems in Linear Time , 1997, J. Chem. Inf. Comput. Sci..

[8]  S. Klavžar.  On the canonical metric representation of graphs and partial Hamming graphs , 2004 .

[9]  Sandi Klavzar,et al.  On the canonical metric representation, average distance, and partial Hamming graphs , 2006, Eur. J. Comb..

[10]  Stephan G. Wagner,et al.  Some new results on distance-based graph invariants , 2009, Eur. J. Comb..

[11]  Ali Reza Ashrafi,et al.  Author's Personal Copy Computers and Mathematics with Applications Another Aspect of Graph Invariants Depending on the Path Metric and an Application in Nanoscience , 2022 .

[12]  Aleksandar Ili,et al.  CALCULATING THE DEGREE DISTANCE OF PARTIAL HAMMING GRAPHS , 2010 .

[13]  W. Imrich.  A simple O ( mn ) algorithm for recognizing Hamming graphs , 2010 .

[14]  Sandi Klavzar and Mohammad J. Nadjafi-Arani.  Cut Method: Update on Recent Developments and Equivalence of Independent Approaches , 2014 .

[15]  Sandi Klavzar,et al.  Wiener index in weighted graphs via unification of Θ∗Θ∗-classes , 2014, Eur. J. Comb..

[16]  Tomás Vetrík,et al.  On the Gutman index and minimum degree , 2014, Discret. Appl. Math..

[17]  Martin Knor,et al.  Relationship between the edge-Wiener index and the Gutman index of a graph , 2014, Discret. Appl. Math..

[18]  Zhongxun Zhu,et al.  Minimum degree distance among cacti with perfect matchings , 2016, Discret. Appl. Math..

[19]  Sudeep Stephen,et al.  Average Distance in Interconnection Networks via Reduction Theorems for Vertex-Weighted Graphs , 2016, Comput. J..

[20]  Ivan Gutman,et al.  On Steiner degree distance of trees , 2016, Appl. Math. Comput..

[21]  Boris Furtula,et al.  On some degree-and-distance-based graph invariants of trees , 2016, Appl. Math. Comput..

[22]  K. Pattabiraman,et al.  Degree and Distance Based Topological Indices of Graphs , 2017, Electron. Notes Discret. Math..

[23]  N. Tratnik.  The Graovac–Pisanski index of zig-zag tubulenes and the generalized cut method , 2017, Journal of Mathematical Chemistry.

[24]  Hongbo Hua,et al.  On eccentric distance sum and degree distance of graphs , 2018, Discret. Appl. Math..