TY - JOUR
T1 - On distance{based graph invariants
AU - Das, Kinkar Ch
AU - Mao, Yaping
AU - Gutman, Ivan
N1 - Publisher Copyright:
© 2021 University of Kragujevac, Faculty of Science. All rights reserved.
PY - 2021
Y1 - 2021
N2 - Let G be a simple connected graph of order n with m edges and diameter d. Let W, WW, H, and RCW be the Wiener index, hyper-Wiener index, Harary index, and reciprocal complementary Wiener index of G. The multiplicative version of Wiener index (π-index) is equal to the product of the distances between all pairs of vertices. We compare H and RCW. For bipartite graph of order n > 5, we prove that π > 2WW. In any connected graph, if d ≥ 4 and m ≤ 285W-6624 287 , then π ≥ 2WW. Some additional relations between W, WW, H, and RCW are also obtained.
AB - Let G be a simple connected graph of order n with m edges and diameter d. Let W, WW, H, and RCW be the Wiener index, hyper-Wiener index, Harary index, and reciprocal complementary Wiener index of G. The multiplicative version of Wiener index (π-index) is equal to the product of the distances between all pairs of vertices. We compare H and RCW. For bipartite graph of order n > 5, we prove that π > 2WW. In any connected graph, if d ≥ 4 and m ≤ 285W-6624 287 , then π ≥ 2WW. Some additional relations between W, WW, H, and RCW are also obtained.
UR - https://www.scopus.com/pages/publications/85113448062
M3 - Article
AN - SCOPUS:85113448062
SN - 0340-6253
VL - 86
SP - 375
EP - 393
JO - Match
JF - Match
IS - 2
ER -