@article {
author = {Narayankar, Kishori and B, Lokesh},
title = {Peripheral Wiener Index of a Graph},
journal = {Communications in Combinatorics and Optimization},
volume = {2},
number = {1},
pages = {43-56},
year = {2017},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2017.13596},
abstract = {The eccentricity of a vertex $v$ is the maximum distance between $v$ and any other vertex. A vertex with maximum eccentricity is called a peripheral vertex. The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, we initiate the study of the peripheral Wiener index and we investigate its basic properties. In particular, we determine the peripheral Wiener index of the cartesian product of two graphs and trees.},
keywords = {Distance (in Graphs),Wiener Index,Peripheral Wiener Index},
url = {http://comb-opt.azaruniv.ac.ir/article_13596.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_13596_983abceb15410e89528e5fcbb919dade.pdf}
}