Terminal wiener index

PDF | Motivated by some recent research on the terminal (reduced) distance matrix, we consider the terminal Wiener index (TW) of trees, equal to the sum.

28 Jul 1997 Generalizations of Wiener Polarity Index and Terminal Wiener Index. Graphs and Combinatorics 2013, 29 (5) , 1403-1416. DOI: 10.1007/s00373-  Index (MTI), Distance Sum, Balaban J index , Sum-Balaban Index, Kirchhoff Index (Kf) or Resistance, Wiener Index (W), Terminal Wiener Index (TW), Reverse   Also, the terminal Wiener index of a graph G is defined by analogy as one half of a sum of the elements of. RD(G). Spectrum-based indices, which are calculated  14 Jun 2016 Keywords: Hosoya polynomial, Acharya index, Terminal Wiener index, Wiener Index. AMS Mathematics Subject Classification (2010): 05C12. S Klavžar, KP Narayankar, HB Walikar, SB Lokesh. Taiwanese Journal of Mathematics 18 (2), 463-471, 2014. 14, 2014. Terminal Wiener Index of Line Graphs,. 1 Sep 2013 For k = 3, we get standard Wiener polarity index. Furthermore, we generalize the terminal Wiener index TW k (G) as the sum of distances  partial characterization of the structure of the extremal caterpillars. Through a similar approach, the maximization problem of the terminal Wiener index is also 

In the last years a numerous modi cation and extensions of the Wiener index was proposed and studied by mathematical chemists, these include the Terminal Wiener index TW(T), proposed by the authors of [6,7]. The Ter-minal Wiener index TW(T) of a tree T, equal to the sum of the distances between all pairs of pendent vertices V p(T) V(T) of the

partial characterization of the structure of the extremal caterpillars. Through a similar approach, the maximization problem of the terminal Wiener index is also  Company Profile. The TSG EDV-Terminal-Service Ges.m.b.h. is part of the Atos Group since July 1, 2011 and has its focus in the banking and insurance sector. 5 Jan 2017 Senbagamalar, " Terminal Wiener Index of Detour saturated Trees and. Nanostar Dendrimers", Journal of Combinatorial Mathematics and  Keywords: Topological index, Wiener polarity index, tensor product, graph, [16] A. Ilić, M. Ilić, Generalizations of Wiener polarity index and terminal Wiener. Wiener Index (LDWI) was introduced by J. Baskar Babujee and A. Subhashini recently in called pendent vertices or terminal vertices. We represent the sum. 18 Dec 2014 Terminal Wiener index of Path-Tree - Salima Trichni, Mohamed Some indices of the bar polyhex graph - Laurent Gneze and Abdellah Idrissi.

Keywords: Topological index, Wiener polarity index, tensor product, graph, [16] A. Ilić, M. Ilić, Generalizations of Wiener polarity index and terminal Wiener.

Terminal Wiener Index for Graph Structures. Authors: J. Baskar Babujee, J. Senbagamalar. Abstract: The topological distance between a pair of vertices i and j,  The terminal Wiener index TW = TW(G) of a graph G is equal to the sum of dis- tances between all pairs of pendent vertices of G. This distance–based molecular   shaila shirkol@rediffmail.com. (Received August 8, 2012). Abstract. The terminal Wiener index of a graph is defined as the sum of the distances between the.

22 Jun 2015 The order of Shannon-Wiener index (H) of all soil samples was in the order of EBF>CF>SDF>AM, whereas bacterial species richness as 

1 Sep 2013 For k = 3, we get standard Wiener polarity index. Furthermore, we generalize the terminal Wiener index TW k (G) as the sum of distances 

61 Note also that Eq. (5) is a kind of recurrence relation, because the terminal Wiener index of a bigger graph (namely of Gp) is expressed in terms of the terminal Wiener index of a smaller graph (namely of G).This observation will be utilized in

The terminal Wiener index of a tree is the sum of distances for all pairs of pendent vertices, which recently arises in the study of phylogenetic tree reconstruction and the neighborhood of trees. This paper presents a sharp upper and lower bounds for the terminal Wiener index in terms of its order and diameter and characterizes all extremal trees which attain these bounds. In addition, we Abstract: The terminal Wiener index of a tree is the sum of distances for all pairs of pendent vertices, which recently arises in the study of phylogenetic tree reconstruction and the neighborhood of trees. This paper presents a sharp upper and lower bounds for the terminal Wiener index in terms of its order and diameter and characterizes all extremal trees which attain these bounds. The aim of this work is to explore the properties of the terminal Wiener index, which was recently proposed by Gutman et al. (2004) , and to show the fact that there exist pairs of trees and chemical trees which cannot be distinguished by using it.We give some general methods for constructing equiseparable pairs and compare the methods with the case for the Wiener index. In the last years a numerous modi cation and extensions of the Wiener index was proposed and studied by mathematical chemists, these include the Terminal Wiener index TW(T), proposed by the authors of [6,7]. The Ter-minal Wiener index TW(T) of a tree T, equal to the sum of the distances between all pairs of pendent vertices V p(T) V(T) of the

Xiaotie Deng and Jie Zhang, Equiseparability on Terminal Wiener Index, Applied mathematics letters. Volume 25, Issue 3, 2012. Conference Papers: 1. 22 Jun 2015 The order of Shannon-Wiener index (H) of all soil samples was in the order of EBF>CF>SDF>AM, whereas bacterial species richness as  Motivated by some recent research on the terminal (reduced) distance matrix, we consider the terminal Wiener index (TW) of trees, equal to the sum of distances between all pairs of pendent vertices. A simple formula for computing TW is obtained and the trees with minimum and maximum TW are characterized. Motivated by some recent research on the terminal (reduced) distance matrix, we consider the terminal Wiener index (TW) of trees, equal to the sum of distances between all pairs of pendent matrix, we consider the terminal Wiener index (TW) of trees, equal to the sum of distances between all pairs of pendent vertices. A simple formula for computing TW is obtained and the trees with