Name
Abstract | ||
|---|---|---|
For a simple connected undirected graph G, the Wiener index W(G) is defined as half the sum of all distances of the form d(u,v), where the summation is over all possible vertex pairs u,v in G. Assuming that G has more than one cut-vertex, we obtain an expression for W(G) in terms of the Wiener indices of the blocks of G and other quantities. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.aml.2007.10.003 | Applied Mathematics Letters |
Keywords | Field | DocType |
Average distance,Block,Cut-vertex,Distance in graphs,Wiener index | Discrete mathematics,Graph,Combinatorics,Wiener index,Of the form,Vertex (geometry),Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 9 | 0893-9659 |
Citations | PageRank | References |
5 | 0.70 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| R. Balakrishnan | 1 | 27 | 3.29 |
| N. Sridharan | 2 | 10 | 3.71 |
| K. Viswanathan Iyer | 3 | 8 | 4.64 |