Back
 AM  Vol.12 No.2 , February 2021
On the Lanzhou Indices of Trees under Graph Decoration
Abstract: The Lanzhou index of a graph G is defined as the sum of the product between and square of du over all vertices u of G, where du and are respectively the degree of u in G and the degree of u in the complement graph of G. R(G) is obtained from G by adding a new vertex corresponding to each edge of G, then joining each new vertex to the end vertices of the corresponding edge. Lanzhou index is an important topological index. It is closely related to the forgotten index and first Zagreb index of graphs. In this note, we characterize the bound of Lanzhou index of R(T) of a tree T. And the corresponding extremal graphs are also determined.

1. Introduction

We use G to denote a simple graph with vertex set V ( G ) = { v 1 , v 2 , , v n } and edge set E ( G ) = { e 1 , e 2 , , e m } . The degree of a vertex v V ( G ) is denoted by d v . The complement graph G ¯ of G has the same vertex set V ( G ) , and two vertices are adjacent in G ¯ if and only if they are not adjacent in G.

Let G be a graph and let v V ( G ) . The first Zagreb index M 1 ( G ) and forgotten index F ( G ) of G are defined respectively as

M 1 ( G ) = v V ( G ) d v 2 and F ( G ) = v V ( G ) d v 3 . (1)

and their theories were well elaborated [1] [2] [3], respectively.

In 2018, Vukičević et al. [4] introduced a new topological index named Lanzhou index, i.e.,

L z ( G ) = v V ( G ) d v 2 d v ¯ , (2)

where d v ¯ denotes the degree of v in G ¯ . And they pointed out a relation among Lanzhou index, forgotten index and first Zagreb index of G, i.e.,

L z ( G ) = ( n 1 ) M 1 ( G ) F ( G ) . (3)

Furthermore, they determined extremal values of Lanzhou index of trees. For the background of Lanzhou index and related topics, we refer the reader to [4] and the references therein.

Let R ( G ) be a graph obtained from G by adding a new vertex v * corresponding to each edge e = u v and by joining each new vertex v * to the end vertices u and v of the edge e = u v corresponding to it [5].

Let T ( n + 1 ) / 2 be a tree with ( n + 1 ) / 2 vertices. In this work, we focus on properties of Lanzhou index of R ( T ( n + 1 ) / 2 ) . We will give the sharp upper bound of Lanzhou index of R ( T ( n + 1 ) / 2 ) . And the extremal graph attained the bound is determined.

2. Main Results

For convenience, we use the same definitions and symbols in [4]. The star on n vertices is denoted by S n . A double star S k , l is a tree obtained from K 2 by attaching k 1 leaves to one of its vertices and l 1 leaves to the other one. Hence, S k , l has one vertex of degree k, one of degree l, and k + l 2 vertices of degree one. A double star on n vertices is balanced if the difference between k and l is the smallest possible. Depending on parity of n, this difference will be either zero for an even n or one for an odd n. Hence, a balanced double star on n vertices is either S n / 2 , n / 2 or S ( n 1 ) / 2 , ( n + 1 ) / 2 . We denote the balanced double star on n vertices by B S ( n ) .

By the definition of Lanzhou index of a graph, we direct yields two results as follows.

Lemma 1. Let R ( S ( n + 1 ) / 2 ) be a graph with n vertices. Then L z ( R ( S ( n + 1 ) / 2 ) ) = 4 ( n 3 ) ( n 1 ) .

Lemma 2. Let R ( B S ( n + 1 ) / 2 ) be a graph with n vertices. Then

L z ( R ( B S ( n + 1 ) / 2 ) ) = ( 1 4 ( n 3 + 15 n 2 85 n + 93 ) if ( n + 1 ) / 2 is even, 1 4 ( n 3 + 15 n 2 89 n + 73 ) if ( n + 1 ) / 2 is odd . (4)

Theorem 1. Let R ( T ( n + 1 ) / 2 ) a graph with n ( 27 ) vertices. Then

L z ( R ( S ( n + 1 ) / 2 ) ) L z ( R ( T ( n + 1 ) / 2 ) ) L z ( R ( B S ( n + 1 ) / 2 ) ) . (5)

Proof. Set that V = V ( R ( T ( n + 1 ) / 2 ) ) is the vertex set of R ( T ( n + 1 ) / 2 ) . Checking the structure of R ( T ( n + 1 ) / 2 ) , we know that | V ( R ( T ( n + 1 ) / 2 ) ) | = n , and n is odd. Let L denote the set of vertices of degree 2 in R ( T ( n + 1 ) / 2 ) . Then V can be decomposed into L and Y, where set Y = V L . Let l = | L | and y = | Y | be the set number of L and Y, respectively. By the Euler formula, we have

u Y d u + 2 l = 3 n 3 ,

and rewriting it as

u Y ( d u 3 ) + 3 ( n l ) + 2 l = 3 n 3.

Thus,

u Y ( d u 3 ) = l 3. (6)

Now, we define the Lanzhou index of the vertex x as c ( x ) , and generally case, c ( x ) = x 2 ( n 1 x ) . Especially, c ( 2 ) = 4 ( n 3 ) = 4 n 12 . Therefore, we can get

L z ( R ( T ( n + 1 ) / 2 ) ) = u V c ( d u ) = u Y c ( d u ) + ( l 3 ) c ( 2 ) + 3 c ( 2 ) . (7)

Substituting Equation (6), we can obtain that

L z ( R ( T ( n + 1 ) / 2 ) ) = u Y [ c ( d u ) + ( d u 3 ) c ( 2 ) ] + 3 c ( 2 ) . (8)

The following we will prove the right of (8) attained the maximum value. By calculating, we have

u Y ( d u 3 + 1 ) = u Y ( d u 2 ) = l 3 + r = n 3. (9)

Timing d u 2 d u 2 on the right-hand side of Equation (8), we get

L z ( R ( T ( n + 1 ) / 2 ) ) = u Y c ( d u ) + ( d u 3 ) c ( 2 ) d u 2 ( d u 2 ) + 3 c ( 2 ) . (10)

We define a function λ ( x ) as follows.

λ ( x ) = c ( x ) + ( x 3 ) c ( 2 ) x 2 = x 2 ( n 1 x ) + 4 ( x 3 ) ( n 3 ) x 2 . (11)

λ + and λ are its maximum and minimum, respectively.

λ + = max d u λ ( d u ) , λ = min d u λ ( d u ) . (12)

Obviously,

λ u Y ( d u 2 ) + 3 c ( 2 ) L z ( R ( T ( n + 1 ) / 2 ) ) λ + u Y ( d u 2 ) + 3 c ( 2 ) . (13)

Substituting Equation (3), we obtain that

λ ( n 3 ) + 3 c ( 2 ) L z ( R ( T ( n + 1 ) / 2 ) ) λ + ( n 3 ) + 3 c ( 2 ) . (14)

In fact, λ ( x ) is a quadratic polynomial with a negative leading coefficient. x = 2 is the root of its numerator, so we can also write λ ( x ) as

λ ( x ) = x 2 + ( n 3 ) x + 6 ( n 3 ) . (15)

By checking its values at x = 2 and x = n 1 , we have

λ = λ ( n 1 ) = ( n 1 ) 2 + ( n 3 ) ( n 1 ) + 6 ( n 3 ) = 4 ( n 4 ) . (16)

So,

L z ( R ( T ( n + 1 ) / 2 ) ) λ ( n 3 ) + 3 c ( 2 ) = 4 ( n 4 ) ( n 3 ) + 12 ( n 3 ) = 4 ( n 3 ) ( n 1 ) = L z ( R ( S ( n + 1 ) / 2 ) ) . (17)

Hence, the Lanzhou index is minimized for R ( S ( n + 1 ) / 2 ) and only for R ( S ( n + 1 ) / 2 ) .

Now discuss the maximum value of Lanzhou index of T ( n + 1 ) / 2 . First, n must

be odd. When λ ( x ) reaches its maximum value, x = n 3 2 , the maximum

value is 1 4 ( n 2 + 18 n 63 ) . In particular, λ ( n 1 2 ) = λ ( n 5 2 ) = 1 4 ( n 2 + 18 n 67 ) ,

λ ( n + 1 2 ) = λ ( n 7 2 ) = 1 4 ( n 2 + 18 n 79 ) , So, λ + = λ ( n 3 2 ) , it has an upper

bound

L z ( R ( T ( n + 1 ) / 2 ) ) ( n 2 4 + 9 n 2 63 4 ) ( n 3 ) + 12 ( n 3 ) = 1 4 ( n 3 + 15 n 2 69 n + 45 ) . (18)

Obviously, the value of this upper bound is larger than the value of L z ( R ( B S ( n + 1 ) / 4 , ( n + 1 ) / 4 ) ) . And the difference is equal to 4 n 12 . In order to demonstrate the conclusion, we must prove that no other T n has the Lanzhou index closer to this upper bound than the R ( B S ( n + 1 ) / 2 ) .

Then, we use contradiction method. Suppose that R ( B S ( n + 1 ) / 2 ) is not an extremal graph.

There exists an extremal graph R ( T e ) with a maximum of two vertices of high degree (the high degree here means that the degree of these two vertices is

n + 1 2 , n 1 2 or n 3 2 , and the degree of these two vertices can only be even).

Because R ( T e ) is not R ( B S ( n + 1 ) / 2 ) , then at least the degree of these two vertices

is smaller than n + 1 2 . According to Lemma 2.2 and formula (4), L z ( R ( T e ) )

not exceed L z ( R ( B S ( n + 1 ) / 2 ) ) . So there are the following cases.

Case 1. When n + 1 2 is even. And n 1 2 is odd.

Suppose that R ( T e ) contains that the degree of one vertex is n + 1 2 , and the another vertex is n 1 2 , the two vertices must be in Y. In this situation, the

corresponding graph cannot be drawn, because the degree of the two vertices must be even, so a contradiction.

Case 2. When n + 1 2 is even. And n 3 2 is odd.

Suppose that R ( T e ) contains that the degree of one vertex is n + 1 2 , and the another vertex is n 3 2 , there must be the degree of a vertex is 4 in R ( T e ) ,

L z ( R ( T e ) ) = 2 2 ( n 3 ) 2 + ( n + 1 2 ) 2 ( n 1 n + 1 2 ) + ( n 3 2 ) 2 ( n 1 n 3 2 ) + 4 2 ( n 1 4 ) = 1 4 ( n 3 + 13 n 2 33 n 173 ) < L z ( R ( B S ( n + 1 ) / 2 ) ) , (19)

a contradiction.

Case 3. When n 1 2 is even. And n 3 2 is odd.

Assume that R ( T e ) contains that the degree of one vertex is n 1 2 , and the another vertex is n 3 2 , the two vertices must be in Y. In this situation, the

corresponding graph cannot be drawn, because the degree of the two vertices must be even, so a contradiction.

Case 4. When n 1 2 is even.

Suppose that R ( T e ) contains that the degree of two vertices are n 1 2 , there

must be the degree of a vertex is 4 in R ( T e ) ,

L z ( R ( T e ) ) = 2 2 ( n 3 ) 2 + 2 ( n 1 2 ) 2 ( n 1 n 1 2 ) + 4 2 ( n 1 4 ) = 1 4 ( n 3 + 13 n 2 29 n 177 ) < L z ( R ( B S ( n + 1 ) / 2 ) ) . (20)

So, a contradiction.

Case 5. When n 1 2 is even. And n 5 2 is even.

Suppose that R ( T e ) contains that the degree of one vertex is n 1 2 and the another vertex is n 5 2 , there must be the degree of two vertices are 4 in

R ( T e ) ,

L z ( R ( T e ) ) = 2 2 ( n 3 ) ( n 4 ) + ( n 1 2 ) 2 ( n 1 n 1 2 ) + ( n 5 2 ) 2 ( n 1 n 5 2 ) = 1 4 ( n 3 + 11 n 2 + 15 n 411 ) < L z ( R ( B S ( n + 1 ) / 2 ) ) . (21)

So, a contradiction. □

Remark 1. If n < 27 , then the result in Theorem 2.3 is not true.

3. Conclusion

The Lanzhou index is an important chemical index. In this note, we determine sharp upper bound of Lanzhou index of R ( T ) when n 27 . In the future, we will discuss a bound of Lanzhou index of R ( G ) of general graph G.

Acknowledgements

This research is supported by the National Natural Science Foundation of China (No. 11761056), the Natural Science Foundation of Qinghai Province (No. 2020-ZJ-920), the Scientific Research Innovation Team in Qinghai Nationalities University.

NOTES

*Corresponding author.

Cite this paper: Zeng, X. and Wu, T. (2021) On the Lanzhou Indices of Trees under Graph Decoration. Applied Mathematics, 12, 85-90. doi: 10.4236/am.2021.122007.
References

[1]   Furtula, B. and Gutman, I. (2015) A Forgotten Topological Index. Journal of Mathematical Chemistry, 53, 1184-1190.
https://doi.org/10.1007/s10910-015-0480-z

[2]   Gutman, I. (2013) Degree-Based Topological Indices. Croatica Chemica Acta, 86, 351-361.
https://doi.org/10.5562/cca2294

[3]   Randić, M. (1996) Molecular Bonding Profiles. Journal of Mathematical Chemistry, 19, 375-392.
https://doi.org/10.1007/BF01166727

[4]   Vukičević, D., Li, Q., Sedlar, J. and Došlić, T. (2018) Lanzhou Index. MATCH Communications in Mathematical and in Computer Chemistry, 80, 863-876.

[5]   Cvetkocić, D.M., Doob, M. and Sachs, H. (1980) Spectra of Graphs Theory and Application. Academic Press, New York.

 
 
Top