TY - JOUR
ID - 13596
TI - Peripheral Wiener Index of a Graph
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Narayankar, Kishori P
AU - B, Lokesh S
AD - Mangalore University
Y1 - 2017
PY - 2017
VL - 2
IS - 1
SP - 43
EP - 56
KW - Distance (in Graphs)
KW - Wiener Index
KW - Peripheral Wiener Index
DO - 10.22049/cco.2017.13596
N2 - 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.
UR - http://comb-opt.azaruniv.ac.ir/article_13596.html
L1 - http://comb-opt.azaruniv.ac.ir/article_13596_983abceb15410e89528e5fcbb919dade.pdf
ER -