Computing the Wiener index of Six-membered ring spiro chains using block-cut-vertex tree
Zhaoyang Luo · Journal of Xinjiang Normal University · 2009
Let be a connected graph.The distance between the vertices and of the graph is equal to the length of a shortest path that connects and.The Wiener index is the sum of distances between all unordered pairs of vertices of a simple graph.The Six-membered ring spiro chains is the graph representations of an important subclass of Linear unbranched,multispiro simplified skeleton molecules,in which every ring is six-membered ring.In this paper,we obtain an expression and the extremal values of the Wiener index of the Six-membered ring spiro chains using block-cut-vertex tree.