Sandi Klavžar, M.J. Nadjafi-Arani, “Improved bounds on the difference between the Szeged index and the Wiener index of graphs”, European Journal of Combinatorics, 39, 2014, 148
M.H. Khalifeh, H. Yousefi-Azari, A.R. Ashrafi, “Another aspect of graph invariants depending on the path metric and an application in nanoscience”, Computers & Mathematics with Applications, 60, no. 8, 2010, 2460
Ivan Gutman, Ljiljana Pavlovic, “On the coefficients of the Laplacian characteristic polynomial of trees”, Bull Class Sci Math, 127, no. 28, 2003, 31
Shouliu Wei, Wai Chee Shiu, Xiaoling Ke, Jianwu Huang, Elena Guardo, “Comparison of the Wiener and Kirchhoff Indices of Random Pentachains”, Journal of Mathematics, 2021, 2021, 1
BAOYINDURENG WU, GUOJIE LIU, XINHUI AN, GUIYING YAN, XIAOPING LIU, “A CONJECTURE ON AVERAGE DISTANCE AND DIAMETER OF A GRAPH”, Discrete Math. Algorithm. Appl., 03, no. 03, 2011, 337
Handbook of Product Graphs, 2011, 447
Kexiang Xu, Jie Li, Zuwen Luo, “Comparative results between the number of subtrees and Wiener index of graphs”, RAIRO-Oper. Res., 56, no. 4, 2022, 2495
M. Knor, P. Potočnik, R. Škrekovski, “On a conjecture about Wiener index in iterated line graphs of trees”, Discrete Mathematics, 312, no. 6, 2012, 1094
Hui Lei, Tao Li, Yuede Ma, Hua Wang, “Analyzing lattice networks through substructures”, Applied Mathematics and Computation, 329, 2018, 297
A. A. Dobrynin, “On 2-Connected Transmission Irregular Graphs”, J. Appl. Ind. Math., 12, no. 4, 2018, 642