Applied Mathematics and Computation 281 (2016) 130–136

Contents lists available at ScienceDirect

Applied Mathematics and Computation

journal homepage: www.elsevier.com/locate/amc

Open quipus with the same Wiener index as their quadratic

line graph✩
M. Ghebleh∗, A. Kanso, D. Stevanović
Department of Mathematics, Faculty of Science, Kuwait University, Safat 13060, Kuwait

a r t i c l e i n f o a b s t r a c t
MSC: An open quipu is a tree constructed by attaching a pendant path to every internal vertex
05C05 of a path. We show that the graph equation W (L2 (T )) = W (T ) has infinitely many non-
05C12
homeomorphic solutions among open quipus. Here W(G) and L(G) denote the Wiener index
05C76
and the line graph of G respectively. This gives a positive answer to the 2004 problem
92E10
of Dobrynin and Mel’nikov on the existence of solutions with arbitrarily large number of
Keywords: arbitrarily long pendant paths, and disproves the 2014 conjecture of Knor and Škrekovski.
Wiener index
© 2016 Elsevier Inc. All rights reserved.
Iterated line graph
Graph equation
Tree

1. Introduction

The Wiener index of a graph is the sum of distances between all pairs of its vertices. It was suggested as a structural
descriptor of acyclic organic molecules by Harry Wiener in 1947 [38], due to its high correlation with the paraffin boiling
points. Its relations to several further properties of organic molecules were subsequently discovered, and it is now widely
used by chemists in quantitative structure-activity relationship studies. See, e.g., [10] for an overview of applications of
Wiener index, and [40] for an extensive survey. Further recent developments can be found in [1,17,20,27,31,35]. Wiener
index attracted attention of mathematicians in the late 1970s when it was introduced in graph theory under the names
distance of a graph and transmission of a graph [16,34,36], and is further studied in the form of average distance of graphs
and networks [7,8]. In [38] Wiener also proposed the so-called Wiener polarity index, that recently found interest among
researchers [15,32,33].
The line graph L(G) of a graph G has edges of G as its vertices, and two vertices of L(G) are adjacent if they have a
common vertex as edges of G. The iterated line graphs Ln (G) where n is a nonnegative integer are recursively defined by
Ln (G ) = L(Ln−1 (G )), where L0 (G ) = G. The size of Ln (G) rapidly increases for most graphs, reflecting the branching (hence
the structural complexity) of G. An accepted opinion in the mathematical chemistry community [13] is that it may be of
interest to characterize molecular graphs by means of structural descriptors calculated for their derived structures. Iterated
line graphs serve as a good example of derived structures, since their invariants have been already used for characterizing
branching of acyclic molecular graphs [3], establishing partial order among isomeric structures [4], evaluating structural
complexity of molecular graphs [18] and designing novel structural descriptors [19].

✩
This work was supported and funded by Kuwait University Research Grant no. SM02/15.
∗
Corresponding author. Tel.: +965 24815351.
E-mail addresses: mghebleh@gmail.com (M. Ghebleh), akanso@hotmail.com (A. Kanso), dragance106@yahoo.com (D. Stevanović).

http://dx.doi.org/10.1016/j.amc.2016.01.040
0096-3003/© 2016 Elsevier Inc. All rights reserved.
 M. Ghebleh et al. / Applied Mathematics and Computation 281 (2016) 130–136 131

u0 u1 u2 u3 u4 u5 u6 u7

v2
v4
v1
v3 v5
v6

Fig. 1. The open quipu Q(3,1,4,2,4,5).

A problem that has raised considerable interest among graph theorists is the equation
W (Li (T )) = W (T ) (1)
where T is a tree and i is a positive integer. For i = 1, this equation has no nontrivial solutions, due to the seminal result of
Buckley:
n 
Theorem 1. [5] For every tree T holds W (L(T )) = W (T ) − 2 .

The case i ≥ 3 has been fully resolved recently in a series of papers [2,21–26] where it was shown that, for i ≥ 3,
Eq. (1) has a solution among nontrivial trees if and only if i = 3 and T is a particular tree Ha,b,c whose description follows:
Ha,b,c is a tree on a + b + c + 4 vertices, out of which two vertices have degree 3, four vertices have degree 1, and the
remaining vertices have degree 2. The two vertices of degree 3 are connected by a path of length 2. There are two pendant
paths of lengths a and b attached to one vertex of degree 3, and two pendant paths of lengths c and 1 attached to the other
vertex of degree 3. Then
W (L3 (Ha,b,c )) = W (Ha,b,c )
if and only if there exist j, k ∈ Z such that
a = 128 + 3 j2 + 3k2 − 3 jk + j,
b = 128 + 3 j2 + 3k2 − 3 jk + k,
c = 128 + 3 j2 + 3k2 − 3 jk + j + k.
The smallest such tree has 388 vertices, which is way out of reach of the brute force power of modern day personal com-
puters. Note that all these solutions Ha,b,c are homeomorphic to the tree H with degree sequence (3, 3, 1, 1, 1, 1).
To complete the study of Eq. (1) it remains to resolve the case i = 2. Small trees satisfying
W (L2 (T )) = W (T ) (2)
have been enumerated in [10] (up to 17 vertices) and [11] (up to 26 vertices). Constructions of infinite families of trees
satisfying Eq. (2) are given by Dobrynin and Mel’nikov [11–14] and by Knor and Škrekovski [28]. However, every known
example of trees satisfying this equation has at most four vertices of degree ≥ 3 and at most four paths whose lengths can
be arbitrarily large. These findings motivated Dobrynin and Mel’nikov to pose the following problem.

Problem 2. [11] Find an infinite family F of trees T satisfying Eq. (2) such that for arbitrary n, m ∈ N the family F contains a
tree T with at least n pendant paths each having length at least m.

Let T be the set of trees that have no vertices of degree 2 and such that T  ∈ T if and only if there exists a tree T
homeomorphic to T that satisfies Eq. (2). Knor and Škrekovski pose the following conjecture.

Conjecture 3. [28] T is a finite set.

We resolve both Problem 2 and Conjecture 3. Since both questions are related to the existence of trees with arbitrarily
large number of vertices of degree at least 3 and arbitrarily long pendant paths, we opt to search for solutions of Eq. (2)
among trees having the form depicted in Fig. 1, as they are well suited for both these requirements. These trees, which
have maximum degree three and in which the vertices of degree three induce a path, are called open quipus by Roo and
Neumaier [39]. They are extensively studied in the problem of characterizing graphs with a given diameter and√minimal
spectral radius [6,9,29,30,37,41], as they represent examples of graphs whose spectral radius is small—at most 32 2 (other
such graphs are closed quipus, in which vertices of degree three induce a cycle, and a dagger, obtained from a path by
adding three pendant vertices at one of its end vertices [39]). Our computer-generated catalogs show that Eq. (2) has an
abundance of solutions among open quipus, and careful mining of these solutions enabled us to prove the following theorem
which positively answers Problem 2 and disproves Conjecture 3.

Theorem 4. For each natural number t ≥ 5, there exists an open quipu Q satisfying W (L2 (Q )) = W (Q ) such that Q contains
12t 2 − 201 vertices of degree three and each pendant path of Q other than two pendant edges, has length either 8t 2 − 136 or
8t 2 − 135.
132 M. Ghebleh et al. / Applied Mathematics and Computation 281 (2016) 130–136

In Section 2 we discuss the Wiener index of open quipus and their quadratic line graphs, and then illustrate the abun-
dance of solutions of Eq. (2) among open quipus. A proof of Theorem 4 is given in Section 3.

2. The Wiener index of open quipu and its quadratic line graph

The formal definition of an open quipu and the terminology we use is as follows.

Definition 1. For n ≥ 3 let the vertices u0 , u1 , . . . , un , un+1 form a path of length n + 1. The comb is obtained from this path
by attaching a pendant vertex vi to each ui for i = 1, . . . , n. Let h = (h1 , . . . , hn ) be a vector of n positive integers. The open
quipu Q(h) is constructed by subdividing (if necessary) each edge ui vi of Qn to a path of length hi for i = 1, . . . , n. We refer
to the path u0 , u1 , . . . , un , un+1 as the main string of Q(h), and to the path obtained by subdividing the edge ui vi as the ith
cord of Q(h). The number n is called the width of Q(h), while the largest length of a cord of Q(h) is called its height.

As we want the main string and the cords to partition V(Q(h)), we will exclude the vertex ui from the ith cord in forth-
coming considerations. Fig. 1 shows an example of an open quipu Q(3,1,4,2,4,5). In the search for solutions of Eq. (2), we
will often identify the open quipu Q(h) and its defining vector h.

Definition 2. The open quipu Q(h) and its defining vector h are both said to be admissible if Q(h) satisfies Eq. (2), i.e., if
W (L2 (Q (h ))) = W (Q (h )).

The open quipu of Fig. 1 satisfies W (L2 (Q (3,1,4,2,4,5 ))) = W (Q (3,1,4,2,4,5 )) = 1882, so that h = (3,1,4,2,4,5 ) is an
admissible vector. Other examples of admissible vectors of small width include (1,2,19), (2,1,1,3), (1,3,2,3,2) and (3,3,2,3,3,3).
We now compute the Wiener index of the open quipu Q(h) and its quadratic line graph. By classifying the vertex pairs
in Q(h) according to their membership to the main string and the cords, and by using the well-known fact that the Wiener
index of a path on n vertices is equal to 16 (n − 1 )n(n + 1 ), reported for the first time in [16], we obtain

1
W (Q (h )) = (n + 1 )(n + 2 )(n + 3 ) (within the main string)
6

n
1
+ (hi − 1 )hi (hi + 1 ) (within the cords)
6
i=1


n+1 
n 
hi
 
+ |x − i| + y (between the main string and the cords)
x=0 i=1 y=1

 
hi h j
 
+ j−i+x+y (between different cords),
1i< jn x=1 y=1

which after simplification gives

1 3 11 1 3
n 1 
n 1  n
11 
W (Q (h )) = n + n2 + n+1+ hi + n+1 h2i + n2 + 2n + hi
6 6 6 2 2 6
i=1 i=1 i=1


n 
n   hi hj

+ i2 hi − (n + 1 ) ihi + j−i+x+y .
i=1 i=1 1i< jn x=1 y=1

Similarly for L2 (Q(h)) we have

 
W (L2 (Q (h ))) = 3n + 9( j − i ) + 6 ) (within the main string)
1i< jn


n
1
+ hi (hi − 1 )(hi − 2 ) (within the cords)
6
i=1


n  i −1
n h  
+ 3|x − i| + 3y + 1 (between the main string and the cords)
x=1 i=1 y=1
hi −1 h j −1
  
+ j−i+x+y (between different cords),
1i< jn x=1 y=1
 M. Ghebleh et al. / Applied Mathematics and Computation 281 (2016) 130–136 133

Table 1
The number of admissible vectors with small width n and height q.

n 2 3 4 5 6 7 8 9 10

3 0 0 0 0 0 0 0 0 0
4 0 2 0 0 0 2 0 0 2
5 0 2 12 16 10 17 14 14 13
6 0 2 48 98 216 297 338 325 582
7 0 0 5 132 707 1633 2580 3788 4909
8 0 0 0 98 1450 7556 20,038 40,696 63,418
9 0 0 0 0 999 17,440 95,532 294,414 650,410
10 0 0 0 0 158 27,919 448,170 2,665,731 9,066,164
11 0 0 0 0 0 2642 228,851 3,468,250 21,505,840
12 0 0 0 0 0 2 66,174 4,061,286 58,457,568
13 0 0 0 0 0 0 2083 1,620,565 77,889,905
14 0 0 0 0 0 0 0 226,890 81,745,409

which after simplification gives

2 3 2 1 3
n 
n   n
1  
n
W (L2 (Q (h ))) = n + 2n2 − n + hi + n h2i + n2 + n − hi + 2 i2 hi
3 3 6 6
i=1 i=1 i=1 i=1


n   
hi hj

− 2 (n + 1 ) ihi − 2hi h j + j−i+x+y .
i=1 1i< jn 1i< jn x=1 y=1

Hence

2
1 5 n 2
n 1 
n 
n
W (L2 (Q (h ))) − W (Q (h )) = n3 + n2 − n − 1 + hi + n2 − n − 2 hi − hi
2 2 2 2
i=1 i=1 i=1


n 
n
+ i2 hi − (n + 1 ) ihi . (3)
i=1 i=1

There are abundant solutions of Eq. (2) among open quipus. Using (3) we enumerated by brute force all admissible
vectors h with small width and height. Table 1 contains the counts of admissible vectors of width n and height q for
3 ≤ n ≤ 14 and 2 ≤ q ≤ 10. Investigating these admissible vectors for patterns, we find many that have two different
cord lengths only, and still many whose cord lengths are equal just to a and a + 1 for some fixed a. We will refer to such
admissible vectors and the corresponding open quipus as balanced in the sequel. Further analysis of the pairs (n, a) among
the enumerated examples of balanced admissible vectors shows the concentration of the value a around  23 n − 2. Table 2
contains the counts of balanced admissible vectors for 6 ≤ n ≤ 38 and a =  23 n − 2, and it clearly shows the abundance
of balanced admissible vectors in the case n = 3r and a = 2r − 2. In the next section we show that even such a restricted
subset of admissible vectors still contains an infinite family of solutions to Eq. (2).

Table 2
Number of admissible balanced vectors for various pairs of (n, a).

(n, a)

r (3r, 2r − 2 ) (3r + 1, 2r − 1 ) (3r + 2, 2r − 1 )

2 2 1 0
3 0 17 0
4 0 16 0
5 42 102 0
6 537 116 0
7 1698 957 0
8 4856 1201 21
9 60,019 6024 10
10 750,127 14,034 16
11 2,399,708 83,337 168
12 12,220,854 150,434 1143
134 M. Ghebleh et al. / Applied Mathematics and Computation 281 (2016) 130–136

3. Balanced open quipus

In this section we search for solutions to Eq. (2) among balanced open quipus, i.e. those corresponding to admissible
vectors h = (h1 , . . . , hn ) with hi ∈ {a, a + 1} for i = 1, . . . , n where a is fixed. Let i = hi − a for i = 1, . . . , n. Then i2 = i as  i
∈ {0, 1}, and we have

n 
n
hi = na + i , (4)
i=1 i=1


n 
n
h2i = na2 + (2a + 1 ) i , (5)
i=1 i=1


n
n (n + 1 )  n
ihi = a+ ii , (6)
2
i=1 i=1


n
n(n + 1 )(2n + 1 )  n
i2 hi = a+ i2 i . (7)
6
i=1 i=1

Plugging (4)–(7) back into (3) we obtain

n2 − (2a + 1 )n − 4 
n
2a + 3 3 a2 + 3a − 2 2 14a + 15
W (L2 (Q (h ))) − W (Q (h )) = n − n − n−1+ i
6 2 6 2
i=1

2

n 
n 
n
− i + i2 i − (n + 1 ) ii . (8)
i=1 i=1 i=1

Based on observed patterns of balanced admissible vectors, we were able to further restrict our search by assuming that
the vector of differences (1 , . . . , n ) consists of a sequence of p − 4 ones, among which four zeros are interspersed, followed
by a sequence of n − p zeros. For given positive integers x < y < z < w  p < n, let

1 if 1  i  p and i
∈ {x, y, z, w},
i =
0 otherwise.
Then

n
i = p − 4,
i=1

n
p( p + 1 )
ii = − ( x + y + z + w ),
2
i=1

n
p( p + 1 )(2p + 1 )
i2 i = − ( x2 + y2 + z 2 + w 2 ) ,
6
i=1

so that (8) becomes

2a + 3 3 a2 + 3a − p + 2 2 3p2 + 6ap + 6p − 10a + 3
W (L2 (Q (h ))) − W (Q (h )) = n − n − n
6 2 6
2p3 − 6p2 + 34p − 54
+ + (n + 1 )(x + y + z + w ) − (x2 + y2 + z2 + w2 ). (9)
6
Further mining among small admissible vectors of this form suggested the choice of values
n = 12k + 3, a = 8k, and p = 6k + 6,
which, when substituted in (9), finally restores some order in the expression:
W (L2 (Q (h ))) − W (Q (h )) = −74k2 − 49k + 19 + (12k + 4 )(x + y + z + w ) − (x2 + y2 + z2 + w2 )
= −(6k + 2 − x )2 − (6k + 2 − y )2 − (6k + 2 − z )2 − (6k + 2 − w )2 + 70k2 + 47k + 35.
Hence for h to be an admissible vector, we need to have
(6k + 2 − x )2 + (6k + 2 − y )2 + (6k + 2 − z )2 + (6k + 2 − w )2 = 70k2 + 47k + 35. (10)
By Lagrange’s four-square theorem, this equation has a solution for x, y, z, w for any fixed k. However, we cannot rely on it
solely, as we also need x, y, z, w to be distinct and belong to {1, . . . , 6k + 6}. On the other hand, it is easy to see that
70k2 + 47k + 35 = (6k + 1 )2 + (5k + 1 )2 + (3k + 4 )2 + (k + 17 ).
 M. Ghebleh et al. / Applied Mathematics and Computation 281 (2016) 130–136 135

Hence a solution to (10) necessarily exists when k + 17 is a perfect square. If

k = t 2 − 17
where t ≥ 5 is an integer, then such solution is given by

x = 1,
y = k + 1 = t 2 − 16,
z = 3k − 2 = 3t 2 − 53,

w = 6k + 2 − k + 17 = 6t 2 − t − 100.
Further,

n = 12k + 3 = 12t 2 − 201,

a = 8k = 8t 2 − 136,
p = 6k + 6 = 6t 2 − 96,
so that an admissible vector ht , for any t ≥ 5, is given by

8t 2 − 135 if i  6t 2 − 96 and i
∈ {1, t 2 − 16, 3t 2 − 53, 6t 2 − t − 100},
hti =
8t 2 − 136 otherwise.

This admissible vector corresponds to an open quipu Q(ht ) satisfying W (L2 (Q (ht ))) = W (Q (ht )), which has 12t 2 − 201 ver-
tices of degree three and cords of length either 8t 2 − 136 or 8t 2 − 135, proving Theorem 4.

4. Concluding comments

Unlike the third degree equation W (L3 (T )) = W (T ) which has very specific solutions, the second degree equation
W (L2 (T )) = W (T ) has an abundance of solutions. We were able to solve the problem of Dobrynin and Mel’nikov and dis-
prove the conjecture of Knor and Škrekovski by identifying an infinite set of solutions to Eq. (2) through a series of special-
izations: first by reducing the search for solutions to the class of open quipus, then by considering open quipus with two
different cord lengths only, and finally by assuming those lengths to be consecutive numbers. A complete characterization
of the solutions of the equation W (L2 (T )) = W (T ) seems to be out of our reach at present.

Acknowledgment

The authors are indebted to the anonymous referees for several improvements to the presentation and pointing out
additional references to relevant recent papers on Wiener index.

References

[1] Y. Alizadeh, V. Andova, S.K. zar, R.v. Skrekovski, Wiener dimension: fundamental properties and (5, 0)-nanotubical fullerenes, MATCH Commun. Math.
Comput. Chem. 72 (2014) 279–294.
[2] S. Bekkai, M. Kouider, On mean distance and girth, Discret. Appl. Math. 158 (2010) 1888–1893.
[3] S.H. Bertz, Branching in graphs and molecules, Discret. Appl. Math. 19 (1988) 65–83.
[4] S.H. Bertz, W.F. Wright, The graph theory approach to synthetic analysis: definition and application of molecular complexity and synthetic complexity,
Graph Theory Notes New York 35 (1998) 32–48.
[5] F. Buckley, Mean distance of line graphs, Congr. Numer. 32 (1981) 153–162.
[6] S.M. Cioabă, E.R. van Dam, J.H. Koolen, J.H. Lee, Asymptotic results on the spectral radius and the diameter of graphs, Linear Algebra Appl. 432 (2010)
722–737.
[7] F.R.K. Chung, The average distance and the independence number, J. Graph Theory 12 (1988) 229–235.
[8] F. Chung, L. Lu, The average distances in random graphs with given expected degrees, Proc. Nat. Acad. Sci. USA 99 (2002) 15879–15882.
[9] E.R. van Dam, R.E. Kooij, The minimal spectral radius of graphs with a given diameter, Linear Algebra Appl. 423 (2007) 408–419.
[10] A.A. Dobrynin, R. Entringer, I. Gutman, Wiener index of trees: theory and applications, Acta Appl. Math. 66 (2001) 211–249.
[11] A.A. Dobrynin, L.S. Mel’nikov, Trees and their quadratic line graphs having the same wiener index, MATCH Commun. Math. Comput. Chem. 50 (2004)
154–164.
[12] A.A. Dobrynin, L.S. Mel’nikov, Some results on the wiener index of iterated line graphs, Electron. Notes Discret. Math. 22 (2005) 460–475.
[13] A.A. Dobrynin, L.S. Mel’nikov, Trees, quadratic line graphs and the wiener index, Croat. Chem. Acta 77 (2004) 477–480.
[14] A.A. Dobrynin, L.S. Mel’nikov, Wiener index of generalized stars and their quadratic line graphs, Discuss. Math. Graph Theory 26 (2006) 161–175.
[15] W. Du, X. Li, Y. Shi, Algorithms and extremal problem on wiener polarity index, MATCH Commun. Math. Comput. Chem. 62 (2009) 235–244.
[16] R.C. Entringer, D.E. Jackson, D.A. Snyder, Distance in graphs, Czechoslov. Math. J. 26 (1976) 283–296.
[17] C.d. Fonseca, M. Ghebleh, A. Kanso, D. Stevanović, Counterexamples to a conjecture on wiener index of common neighborhood graphs, MATCH Com-
mun. Math. Comput. Chem. 72 (2014) 333–338.
[18] I. Gutman, E. Estrada, Topological indices based on the line graph of the molecular graph, J. Chem. Inf. Comput. Sci. 36 (1996) 541–543.
[19] I. Gutman, L. Popović, B.K. Mishra, M. Kuanar, E. Estrada, N. Guevara, Application of line graphs in physical chemistry. predicting surface tension of
alkanes, J. Serb. Chem. Soc. 62 (1997) 1025–1029.
[20] M. Knor, B.L. zar, R.v. Skrekovski, I. Gutman, On wiener index of common neighborhood graphs, MATCH Commun. Math. Comput. Chem. 72 (2014)
321–332.
[21] M. Knor, M. Mačaj, P. Potočnik, R. Škrekovski, Trees t satisfying w(l 3 (t )) = w(t ), Filomat 28 (2014) 551–556.
136 M. Ghebleh et al. / Applied Mathematics and Computation 281 (2016) 130–136

[22] M. Knor, M. Mačaj, P. Potočnik, R. Škrekovski, Complete solution of equation w(l 3 (t )) = w(t ) for the wiener index of iterated line graphs, Discret. Appl.
Math. 171 (2014) 90–103.
[23] M. Knor, P. Potočnik, R. Škrekovski, On a conjecture about wiener index in iterated line graphs of trees, Discrete Appl. Math. 312 (2012) 1094–1105.
[24] M. Knor, P. Potočnik, R. Škrekovski, The wiener index in iterated line graphs, Discret. Appl. Math. 160 (2012) 2234–2245.
[25] M. Knor, P. Potočnik, R. Škrekovski, Wiener index of iterated line graphs homeomorphic to h, Discret.Math. 313 (2013) 1104–1111.
[26] M. Knor, P. Potočnik, R. Škrekovski, Wiener index of iterated line graphs homeomorphic to the claw k1, 3 , Ars Math. Contemp. 6 (2013) 211–219.
[27] M. Knor, R. Škrekovski, Wiener index of line graphs, in: M. Dehmer, F. Emmert-Streib (Eds.), Quantitative graph theory: Mathematical foundations and
applications, CRC Press, Boca Raton, 2015, pp. 279–302.
[28] M. Knor, R. Škrekovski, Wiener index of generalized 4-stars and their quadratic line graphs, Australas. J. Comb. 58 (2014) 119–126.
[29] J. Lan, L. Li, L. Shi, Graphs with diameter n − e minimizing the spectral
√ radius, Linear Algebra Appl. 437 (2012) 2823–2850.
[30] J. Lan, L. Lu, Diameters of graphs with spectral radius at most 32 2, Linear Algebra Appl. 438 (2013) 4382–4407.
[31] H. Lin, Extremal wiener index of trees with given number of vertices of even degree, MATCH Commun. Math. Comput. Chem. 72 (2014) 311–320.
[32] J. Ma, Y. Shi, Z. Wang, J. Yue, On wiener polarity index of bicyclic networks, Sci. Rep. 6 (2016) 19066, doi:10.1038/srep19066.
[33] J. Ma, Y. Shi, J. Yue, The wiener polarity index of graph products, Ars Combin. 116 (2014) 235–244.
[34] J.P. k, On the sum of all distances in a graph or digraph, J. Graph Theory 8 (1984) 1–21.
[35] R.v. Skrekovski, I. Gutman, Vertex version of the wiener theorem, MATCH Commun. Math. Comput. Chem. 72 (2014) 295–300.
[36] L. Šoltés, Transmission in graphs: a bound and vertex removing, Math. Slovaca 41 (1991) 11–16.√
[37] J. Wang, Q. Huang, X. An, F. Belardo, Some notes on graphs whose spectral radius is close to 32 2, Linear Algebra Appl. 429 (2008) 1606–1618.
[38] H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. √ Soc. 69 (1947) 17–20.
[39] R. Woo, A. Neumaier, On graphs whose spectral radius is bounded by 32 2, Graphs Comb. 23 (2007) 713–726.
[40] K. Xu, M. Liu, K.C. Das, I. Gutman, B. Furtula, A survey on graphs extremal with respect to distance-based topological indices, MATCH Commun. Math.
Comput. Chem. 71 (2014) 461–508.
[41] X.Y. Yuan, J.Y. Shao, Y. Liu, The minimal spectral radius of graphs of order n with diameter n − 4, Linear Algebra Appl. 428 (2008) 2840–2851.