CCO Commun. Comb. Optim.

Size: px
Start display at page:

Download "CCO Commun. Comb. Optim."

Transcription

1 Communications in Combinatorics and Optimization Vol. 3 No., 018 pp DOI: /CCO CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman, Zepeng Li 3, Shaohui Wang 4, Pu Wu 1 1 Institute of Computing Science and Technology, Guangzhou University Guangzhou , China zshao@gzhu.edu.cn, puwu1997@16.com Faculty of Science, University of Kragujevac, Kragujevac, Serbia gutman@kg.ac.rs 3 School of Information Science and Engineering, Lanzhou University Lanzhou , China lizp@lzu.edu.cn 4 Department of Mathematics, Savannah State University, Savannah, GA 31404, USA shaohuiwang@yahoo.com Received: 1 June 018; Accepted: 14 August 018 Published Online: 16 August 018 Communicated by Seyed Mahmoud Sheikholeslami Abstract: By d(v G) and d (v G) are denoted the number of first and second neighbors of the vertex v of the graph G. The first, second, and third leap Zagreb indices of G are defined as LM 1 (G) = v V (G) d (v G), LM (G) = uv E(G) d (u G) d (v G), and LM 3 (G) = v V (G) d(v G) d (v G), respectively. In this paper, we generalize the results of Naji et al. [Commun. Combin. Optim. (017), ], pertaining to trees and unicyclic graphs. In addition, we determine upper and lower bounds on these leap Zagreb indices and characterize the extremal graphs. Keywords: Leap Zagreb index, Zagreb index, degree (of vertex) AMS Subject classification: 05C10, 05C35, 05C90 1. Introduction In this paper, we only consider graphs without multiple edges or loops. The degree of a vertex v in a considered graph is denoted by d(v). A double star S r,s is a tree with exactly two vertices u and v that are not leaves, such that (d(u), d(v)) = (r +1, s+1). Corresponding Author c 018 Azarbaijan Shahid Madani University. All rights reserved.

2 180 Leap Zagreb Indices of Trees and Unicyclic Graphs The triangular unicyclic graph T r,s,t is a unicyclic graph containing a triangle uvw with vertices u, v, and w, such that (d(u), d(v), d(w)) = (r +, s +, t + ). If uvw is the triangle of an n-vertex triangular unicyclic graph G, and if G uvw = P n 3, then G will be denoted T P n. By S n + e is denoted the graph obtained by connecting with a new edge e two leaf vertices of the star S n. A graph is called a {C 3, C 4 }-free graph if it contains neither C 3 nor C 4. In the interdisciplinary area where chemistry, physics and mathematics meet, molecular graph based structure descriptors, usually referred to as topological indices, are of significant importance [3, 4, 11]. Among the most important such structure descriptors are the classical two Zagreb indices [6, 7], M 1 (G) = u V (G) d(u G) and M (G) = uv E(G) d(u G) d(v G), where G is a graph whose vertex set is V (G) and whose edge set is E(G). By d(u G) is denoted the degree (= number of first neighbors) of the vertex v V (G) and by uv the edge between the vertices u and v. For details of the theory of Zagreb indices see the recent survey [] and the references cited therein. Motivated by the success of Zagreb indices, and following an earlier work [10], Naji et al. [9] introduced the concept of leap Zagreb indices, based on the second degrees of vertices. The k-degree of the vertex v V (G), denoted by d k (v G) or d k (v), is the number of vertices of G whose distance to v is equal to k. Evidently, d 1 (v G) = d(v G). The first, second, and third leap Zagreb indices of a graph G, proposed in [9], are defined respectively as LM 1 (G) = LM (G) = LM 3 (G) = v V (G) uv E(G) v V (G) d (v G) d (u G) d (v G) d(v G) d (v G). In fact, a quantity identical to the third leap Zagreb index LM 3 (G) of a graph G appeared in a paper published in the 1970 [7], but did not attract any attention. The same was the case with a paper from 008 [1]. Quite recently, independently of [9], Ali and Trinajstić re-invented this leap Zagreb index and named it modified first Zagreb connection indices [1]. In [9], the leap Zagreb indices of some graph families and graph joins were determined, as well as of triangle and quadrangle free graphs. In a later work [8], the leap Zagreb indices of graph operations were studied. Leap Zagreb indices are considered in a recent survey [5].

3 Z. Shao, I. Gutman, Z. Li, S. Wang, P. Wu 181 Motivated by these researches, in the present paper we establish sharp upper and lower bounds on the leap Zagreb indices of trees and unicyclic graphs and characterize the extremal graphs.. Preliminaries The following functions and definitions will be used throughout the paper. Let g(n) = (n 3) (n+6) 9, n 0 (mod 3) (n 3) (n+6) , n 1 (mod 3) (n 3) (n+6) 9 7 9, n (mod 3). It can be seen that g(n) g(n 1) n n 1 3. (1) For an edge e = uv E(G), we define LM (e G) = d (u G) d (v G), and LM (e G) is written as LM (e) when no confusion can arise. Proposition 1. [9] Let P n and S n be the path and star on n vertices. For n 4, (i) LM 1(S n) = (n 1)(n ) and LM 1(P n) = 4(n 3), (ii) LM (S n) = 0 and LM (P n) = 4n 14, (iii) LM 3(S n) = (n 1)(n ) and LM 3(P n) = 4n 10. The following results are immediate and their proofs are omitted. Lemma 1. Let r, s be positive integers with r+s+ = n. Then LM 1(S r,s) = r 3 +s 3 +r +s and LM (S r,s) = rs(1 + r + s). (i) If n is even, then LM (S r,s) (n 1)( n 1). The equality holds if and only if r = s. (ii) If n is odd, then LM (S r,s) 1 (n 3)(n 4 1). The equality holds if and only if r s = 1. Proof. By the definitions of LM 1 and LM, it is clear that LM 1 (S r,s ) = r 3 + s 3 + r + s and LM (S r,s ) = rs(1 + r + s). Then LM (S r,s ) = rs(1 + r + s) = r(n r)(n 1). Therefore, (i) If n is even, then LM (S r,s ) = r(n r)(n 1) ( ) n r+r (n 1) = (n 1)( n 1). The equality holds if and only if r = n r, i.e., r = s = n. (ii) If n is odd, we consider the function h(r) = r(n r)(n 1) and obtain that h(r) = r(n r)(n 1) 1 4 (n 3)(n 1), and the equality holds if and only if r s = 1.

4 18 Leap Zagreb Indices of Trees and Unicyclic Graphs Lemma. Let n 6. Then LM 1(T P n) = 4n 10, LM 1(S n + e) = (n 3)(n n ). Lemma 3. Let n 6 with r+s+t+3 = n. Then LM (T P n) = 4n 13 and LM (T r,s,t) = (r + s)(r + t) + (r + s)(s + t) + (r + t)(s + t) + r(r + 1)(s + t) + s(s + 1)(r + t) + t(t + 1)(r + s). Lemma 4. Let x y z be non-negative integers such that x + y + z + 3 = n and f(x, y, z) = (x + y)(x + z) + (x + y)(y + z) + (x + z)(y + z) + x(x + 1)(y + z) + y(y + 1)(x + z) + z(z + 1)(x + y). Then f(x, y, z) g(n). Moreover, (i) if n 0 (mod 3), then the equality holds if and only if x = y = z. (ii) If n 1 (mod 3), then the equality holds if and only if x = y = z 1. (iii) If n (mod 3), then the equality holds if and only if x = y 1 = z 1. Lemma 5. Let n 6 with r +s+t+3 = n. Then LM 3(T P n) = 4n 8 and LM 3(T r,s,t) = (n 3)(n + ). Lemma 6. Let G be a {C 3, C 4}-free graph. Then for any v V (G), d (v) = (d(u) 1) u N(v) where N(v) is the set of first neighbors of the vertex v. Recall that Lemma 6 was earlier communicated by Naji et al., [9]. 3. Main results In this section, we obtain bounds on the leap Zagreb indices of trees and unicyclic graphs Extremal trees on leap Zagreb indices Theorem 1. Let T be an n-vertex tree with n 4. Then 4(n 3) LM 1(T ) (n 1)(n ) with the left equality if and only if T = P n and the right equality if and only if T = S n. Proof. Since n 4, we have diam(t ). If diam(t ) =, then T = S n. By Proposition 1, we know that the result is true. If diam(t ) = 3, then T = S r,s, where r and s are two positive integers such that r + s + = n. Then by Lemma 1, LM 1 (T ) = r 3 + s 3 + r + s.

5 Z. Shao, I. Gutman, Z. Li, S. Wang, P. Wu 183 Since r, s 1, we have LM 1 (T ) (r + s ) (r + s) = (n ) 4(n 3). If n = 4, then T = P 4 and LM 1 (T ) = (n ) = 4(n 3). Thus, the result is true. If n 5, then LM 1 (T ) = (n ) > 4(n 3). On the other hand, LM 1 (T ) = r (r + 1) + s (s + 1) = (n s ) (n s + 1) + s (s + 1) = (n 1)(n ) + s (3n 4) s(3n 10n + 8). Since s < n, we have s(3n 4) (3n 10n+8) < (n )(3n 4) (3n 10n+8) = 0. Thus, LM 1 (T ) < (n 1)(n ). Assume now that diam(t ) 4 and proceed by induction on n. Let P = x 1 x... x diam(t ) be a longest path of T. Then x 1 is a leaf of T. Let T = T x 1. Then we have d (v T ) = d (v T ) 1 if v N(x T ), and d (v T ) = d (v T ) otherwise. By Lemma 6, we have d (x 1 T ) = d(x T ) 1. () Thus, LM 1 (T ) = LM 1 (T ) v N(x T ) = LM 1 (T ) + d (x 1 T ) + d (v T ) + = LM 1 (T ) + (d(x T ) 1) + v N(x T ) v N(x T ) v N(x T ) = LM 1 (T ) + (d(x T ) 1)(d(x T ) ) + d (v T ) (d (v T ) d (v T ) ) (d (v T ) 1) (Applying Eq. ()) v N(x T ) d (v T ). By induction, 4(n 4) LM 1 (T ) (n )(n 3), with the left equality if and only if T = P n 1 and the right equality if and only if T = S n 1. Moreover, by Lemma 6 we have d (v T ) = d(x T ) 1 for each v N(x T )\{x 3 } and d(x T ) d (x 3 T ) n 3 since diam(t ) 4. Note that d(x T ) n 3. Therefore, LM 1 (T ) = LM 1 (T ) + (d(x T ) 1)(d(x T ) ) + v N(x T ) 4(n 4) + d (x 3 T ) 4(n 4) + d(x T ) 4(n 3) d (v T ) with equality if and only if LM 1 (T ) = 4(n 4) and d(x T ) =, which yields T = P n.

6 184 Leap Zagreb Indices of Trees and Unicyclic Graphs On the other hand, LM 1 (T ) = LM 1 (T ) + (d(x T ) 1)(d(x T ) ) + d (v T ) v N(x T ) LM 1 (T ) + 3(d(x T ) 1)(d(x T ) ) + d (x 3 T ) (n )(n 3) + 3(n 4)(n 5) + (n 3) < (n )(n 3) + (n 3)(3n 10) < (n 1)(n ). By Proposition 1, we have Corollary 1. diam(t ). Let T be an n-vertex tree with n 3. Then LM (T ) = 0 if and only if Proof. If T = S n, then by Proposition 1, part (ii), LM (T ) = 0. Suppose that LM (T ) = 0. Then diam(t ). Otherwise, T would contain a path P = x 1 x x 3 x 4, which would imply LM (T ) d (x T )d (x 3 T ) 1, a contradiction. Therefore, T = S n. We use E(x G) to denote the set of edges incident with x in G. Lemma 7. For any tree T with diam(t ) 4, there exists a tree T with V (T ) = V (T ) and diam(t ) = diam(t ) 1, such that LM (T ) > LM (T ). Proof. Choose a longest path P = x 1 x... x t in T and let N(x T ) = {x 1, x 3, y 1,..., y r }. Then t 5 since diam(t ) 4. We construct a new tree T 1 as follows: V (T 1 ) = V (T ), E(T 1 ) = E(T ) {x 4 x 1, x 4 y 1,..., x 4 y r } \ {x x 1, x y 1,..., x y r }. It can be checked that d (v T 1 ) d (v T ) for any vertex v V (T 1 ) and d (x 5 T 1 ) > d (x 5 T ). Thus, LM (T 1 ) > LM (T ). If diam(t 1 ) = diam(t ) 1, then T 1 is a desired graph and we set T = T 1. Otherwise, diam(t 1 ) = diam(t ). By repeating the procedure we obtain a tree T m with V (T m ) = V (T ), diam(t m ) = diam(t ) 1 and LM (T m ) > LM (T ). Then T m is the desired graph and we set T = T m. Theorem. For any n-vertex tree with n 5 vertices and diam(t ) 3, it holds LM (P n) LM (T ) LM (S r,s), where r, s are two positive integers such that r+s+ = n and r s {0, 1}.

7 Z. Shao, I. Gutman, Z. Li, S. Wang, P. Wu 185 Proof. The proof is by induction on n. If n = 5, then the result is trivial. Therefore, assume that n 6. Let P = x 1 x... x diam(t ) be a longest path of T and T = T (N(x T )\{x 3 }). Then d (v T ) = d (v T ) d(x T )+1 if v = x 3 and d (v T ) = d (v T ) otherwise. Thus, LM (T ) = LM (T ) d (u T ) d (v T ) + d (u T ) d (v T ) = LM (T ) + + uv E(x 3 T ) uv E(x T )\{x x 3} = LM (T ) + + v N(x 3 T ) uv E(x 3 T ) uv E(x T ) E(x 3 T ) (d (u T ) d (v T ) d (u T ) d (v T )) d (u T ) d (v T ) v N(x T )\{x 3} d (x T ) d (v T ) (d (x 3 T ) d (v T ) d (x 3 T ) d (v T )) = LM (T ) + d (x T )(d(x T ) 1) + (d(x T ) 1) v N(x 3 T ) d (v T ). By induction, we have 4n 18 = LM (P n 1 ) LM (T ) LM (S r,s ), with the left equality if and only if T = P n d(x T )+1 and the right equality if and only if T = S r,s, where r, s are two positive integers such that r +s + = n d(x T )+1 and r s {0, 1}. Since LM (T ) > 0, by Theorem 1, diam(t ) 3. Then d(x T ) and d(x 3 T ). If d(x T ) 3, then LM (T ) LM (T ) + 4d (x T ) + d (v T ) 4n (d(x 3 T ) 1) If d(x 3 T ) 3, then v N(x 3 T ) + d(x 3 T )(d(x 3 T ) 1) 4n 10 > 4n 14. LM (T ) LM (T ) + d (x T ) + v N(x 3 T ) + d(x 3 T )(d(x 3 T ) 1) 4n 10 > 4n 14. d (v T ) 4n 18 + (d(x 3 T ) 1) Assume now that d(x T ) = d(x 3 T ) =. Since n 6, we have diam(t ) 4. If diam(t ) = 4, then T = S 1,n 4 and by Lemma 1, LM (T ) = (n 4)(n ). Thus, LM (T ) = LM (T ) + d (x T )(d(x T ) 1) + (d(x T ) 1) d (v T ) = (n 4)(n ) > 4n 14. v N(x 3 T )

8 186 Leap Zagreb Indices of Trees and Unicyclic Graphs If diam(t ) 5, then d (x 4 T ) and v N(x 3 T ) d (v T ) 3. Thus, LM (T ) = LM (T ) + d (x T )(d(x T ) 1) + (d(x T ) 1) d (v T ) 4n = 4n 14, v N(x 3 T ) with the equality if and only if T = P n d(x T )+1 and v N(x 3 T ) d (v T ) = 3. Note that d(x T ) =, from which it follows T = P n. Now we show the right inequality. If diam(t ) = 3, then T is a double star. By Lemma 1, we know that the inequality is true. Now we assume that diam(t ) = p 4. By Lemma 7, there exists a sequence of n-vertex trees T 1, T,..., T p 3 such that diam(t i ) = diam(t ) i and LM (T i 1 ) < LM (T i ), where i = 1,,..., p 3 and T 0 = T. Hence, LM (T ) < LM (T p 3 ). Note that diam(t p 3 ) = diam(t ) (p 3) = 3, that is, T p 3 is a double star. By Lemma 1, LM (T p 3 ) LM (S r,s ), where r, s are two positive integers such that r+s+ = n and r s {0, 1}. Hence, LM (T ) < LM (S r,s ), which completes the proof. Theorem 3. Let T be an n-vertex tree with n 5 vertices. Then (n 5) LM 3(T ) (n 1)(n ). The left equality holds if and only if T = P n whereas the right equality holds if and only if T is a star or a double star. Proof. The proof is by induction on n and is fully analogous to that of Theorem. We omit the details. 3.. Extremal unicyclic graphs on leap Zagreb indices Theorem 4. Let G be an n-vertex unicyclic graph with n 6. Then 4n 10 LM 1(G) (n 3)(n n ) with the left equality if and only if G = T P n and the right equality if and only if G = S n + e. Proof. The proof is by induction on n. If n = 6, then the result is trivial. Now we assume that n 7. Let P = x 1 x... x t be a longest path of G from a leaf to the cycle. If t = 0, then G = C n and LM 1 (G) = 4n < (n 3)(n n ). So the result is true. Assume now that t 1 and let G = G x 1. Then d (v G) = d (v G ) + 1 if

9 Z. Shao, I. Gutman, Z. Li, S. Wang, P. Wu 187 v N(x G ) and d (v G ) = d (v G) otherwise. Thus, LM 1 (G) = LM 1 (G ) v N(x G ) = LM 1 (G ) + d (x 1 G) + d (v G ) + = LM 1 (G ) + (d(x G) 1) + v N(x G ) v N(x T ) v N(x G ) = LM 1 (G ) + (d(x G) 1)(d(x G) ) + d (v G) (d (v G) d (v G ) ) (d (v G) 1) v N(x G ) d (v G). By induction, we have 4n 14 LM 1 (G ) (n 4)(n 4n + 1), with the left equality if and only if G = T P n 1 and the right equality if and only if G = S n 1 + e. If d(x G) 3 or d (x 3 G), then LM 1 (G) LM 1 (G ) + 4 = 4n 10, with the equality if and only if G = T P n 1, and d(x G) = 3 and d (x 3 G) 1 or d(x G) and d (x 3 G) =. Since n 7, d (x 3 G). So the equality holds if and only if G = T P n 1, d(x G) =, and d (x 3 G) =, which implies that G = T P n. If d(x G) and d (x 3 G) 1, then d(x G) = and d (x 3 G) = 1. Thus, N[x 3 G] = V (G) \ {x 1 } and G = S n 1 + e. It follows hat LM 1 (G) LM 1 (G ) + = (n 4)(n 4n + 1) + > 4n 10. On the other hand, if d(x G) n, then LM 1 (G) LM 1 (G ) + (n 3)(n 4) + (n 3) (n 4)(n 4n + 1) + (n 3)(3n 10) = (n 3)(n n ) (6n 0) < (n 3)(n n ). If d(x G) n 1, then G = S n + e and LM 1 (G) = (n 3)(n n ). Theorem 5. Let G be an n-vertex unicyclic graph with at least eight vertices. Then LM (T P n) < LM (G) < LM (T r,s,t) where r, s, and t are positive integers, such that r s t, r + s + t + 3 = n, and r t 1. Proof. We first prove the left inequality. The proof is by induction on n. If n = 8, then the result can be verified by computer search. Therefore, we assume that n 9. Note that if G = T P n, then LM (G) = 4n 13. Now we show that there exists no unicyclic graph G having minimum LM (G), but G = T Pn. Otherwise, let G be such a graph for which LM (G ) LM (T P n ) = 4n 13. (3)

10 188 Leap Zagreb Indices of Trees and Unicyclic Graphs Note that LM (C n ) = 4n > 4n 13, implying that G is not a cycle. Therefore, there exists a vertex v with degree one in G. Let vuw be a path in G with d(w G ) 1. Case 1. If d(u G ) 3, then d (v G ). If d (u G ), then LM (uv G ) 4. Let H = G v. Then LM (G ) LM (H) + LM (uv G ) LM (H) + 4. By induction, LM (H) 4(n 1) 13 and so we have LM (G ) 4n 13. Due to LM (G ) being minimum, we can deduce H = T P n 1. Therefore, G is the graph obtained by adding a vertex u and an edge uv, where v is a vertex with degree one in T P n 1. It is clear that LM (G ) is minimum if and only if G = T P n. If d (u G ) = 1, then d (v G ). Then d (x H) = d (x G ) 1 for any x N(u) \ {v}. Therefore, LM (G ) LM (H) + LM (uv G ) + e E(u G )\{uv} LM (e) 4(n 1) d (u)(d(u) 1) 4n 13. e E(u H)\{uv} LM (e) Since LM (G ) is minimum, we have H = T P n 1. Therefore, G is the graph obtained by adding a vertex u and an edge uv, where v is a vertex with degree one in T P n 1. Clearly, LM (G ) is minimum if and only if G = T P n. If d (u) = 0, then G is the graph obtained by adding an edge to the star. Clearly, LM (G ) > 4n 13, a contradiction with Eq. (3). Case. If d(u) =, then d (u) = d(w) 1 and d (v) = 1. First, we show that d (w). Otherwise, N[w] {v} = V (G ). Since n 9, there is a vertex x N(w) with d(x) = 1. Then we get the left inequality as desired by the proof of Case 1. Now we have d (w) and so d (y) 1, for each y V (G ). Therefore, LM (G) LM (H) + LM (uv G ) + LM (uw G ) + LM (e) LM (e) LM (uw H) e (E(w G )\{uw}) e (E(w H)\{uw}) 4(n 1) 13 + d (u) + d (u) d (w) + d (v) v N(w)\{u} d (u)(d (w) 1) 4(n 1) 13 + d(w) 1 + d(w) 1 + d (v). v N(w)\{u} If there is a vertex q N(w) {u} with d (q) or d(w) 3, then LM (G) 4(n 1) 13 + d(w) 1 + d(w) 1 + d (v) v N(w)\{u} 4(n 1) 13 + d(w) 1 + d(w) 1 + 4n 13.

11 Z. Shao, I. Gutman, Z. Li, S. Wang, P. Wu 189 We now only consider the condition d(w) = and d (x) = for any x N(w) {u}. Then all vertices except u, v, x are adjacent to x. Since n 9, there is a leaf adjacent to x and d(x) 3. Then we get the inequality by the proof of Case 1. Now we prove the right inequality. Let G be a unicyclic graph that maximizes LM (G ) and C = v 1 v v k be the unique cycle of G. Then Claim 1. For any u V (G ), d(u, C) 1. Proof. Suppose to the contrary that there exists a vertex u such that d(u, C) = p 1. Assume that u 1 u u p is a shortest path from u 1 to C where u 1 = u and u p = v i for some i = 1,,..., k. If p 4, then we construct a graph G such that V (G ) = V (G ) and E(G ) = E(G ) {u p 3 x x L(u p 1 )} \ {u p 1 x x L(u p 1 )}. Then LM (G ) > LM (G ), contradicting with the assumption that G has maximum LM (G ). If p = 3, then we construct a graph G such that V (G ) = V (G ) and E(G ) = E(G ) {v i 1 x x L(u p 1 )} \ {u p 1 x x L(u p 1 )}. Then LM (G ) > LM (G ), contradicting with the assumption that G has maximum LM (G ). For the upper bound, the proof is by induction on n. If n = 8, we can verify the result by computer search. Now we consider the case n 9 and suppose that for any unicyclic graph G of order n 1, LM (G ) LM (T r,s,t ), (4) where r s t, r + s + t + 3 = n 1 and r t 1. It can be verified that LM (C n ) < LM (T r,s,t ), where r s t, r + s + t + 3 = n and r t 1. Therefore, G is not a cycle. Therefore, each vertex not in C of degree one and has a neighbor in C. If k = 3,then by Lemmas 4 and 5, the right inequality holds. If k = 4, then G is a graph whose removal of all leaf vertices results in C 4. Then by analysis a function with three variables, we can obtain the desired result. If k = 5, then G is a graph whose removal of all leaf vertices results in C 5. Then by analysis a function with four variables, we can obtain the desired result. Now we consider the case k 6. Let v i be a vertex in C with minimum degree. Construct a graph G such that V (G ) = V (G ) \ {v i 1 } and E(G ) = E(G )

12 190 Leap Zagreb Indices of Trees and Unicyclic Graphs {v i v i } {v i x x L(v i 1 )} \ {v i 1 x x L(v i 1 )}. Let A 1 = {v i 1 u u L(v i 1 G )}, B 1 = {v i 1 v i }, C 1 = {v i u u L(v i G )}, D 1 = E(G ) \ (A 1 B 1 {v i 1 v i } C 1 E 1 ), E 1 = {v i v i+1 }, A = {v i u u L(v i 1 G )}, B = {v i v i }, C = {v i u u L(v i G )}, D = E(G ) \ (A B E 1 ). We define a one-to-one mapping h : E(G ) E(G ) such that h(v p v q ) = v p v q if v p v q D 1, h(v i 1 u) = v i u if u L(v i 1 G ), i.e., v i 1 u A 1, h(v i 1 v i ) = v i v i, i.e., v i 1 u B 1. Let 1 = d (v i G )d (v i 1 G ) d (v i G )d (v i G ). Then by the choice of v i and Lemma 6 we have 1 = (d(v i 3 G ) + d(v i 1 G ) )(d(v i G ) + d(v i G ) ) (d(v i 3 G ) + d(v i G ) )(d(v i G ) + d(v i+1 G ) ). Since d(v j G ) = d(v j G ) for any j {i 3, i, i + 1}, d(v i G ) 0, and d(v i G ) = d(v i G ) + d(v i 1 G ), we have 1 0, i.e., for any e B 1 LM (e G ) LM (h(e) G ). (5) For any vertex u L(v i 1 ) in G, d (u G )d (v i 1 G ) = (d(v i G ) 1)d (v i G ) = (d(v i G ) 1)(d(v i G ) + d(v i G ) ), and d (u G )d (v i G ) = (d(v i G ) 1)d (v i G ) = (d(v i G ) 1)(d(v i G ) + d(v i+1 G ) ).

13 Z. Shao, I. Gutman, Z. Li, S. Wang, P. Wu 191 Since d(v j G ) = d(v j G ) for any j {i 1, i + }, d (u G )d (v i 1 G ) d (u G )d (v i G ). Then for any e A 1, we have LM (e G ) LM (h(e) G ). Now for any vertex u L(v i ) in G, we have d (u G )d (v i G ) = (d(v i G ) 1)d (v i G ) = (d(v i G ) 1)(d(v i 1 G ) + d(v i+1 G ) ), d (u G )d (v i G ) = (d(v i G ) 1)d (v i G ) = (d(v i G ) + d(v i 1 ) 3)(d(v i G ) + d(v i+1 G ) ). Let = d (u G )d (v i G ) d (u G )d (v i G ). Then = (d(v i G ) 1)(d(v i G ) d(v i 1 G )) + (d(v i 1 G ) )(d(v i G ) + d(v i+1 G ) ) = (d(v i 1 G ) )(d(v i+1 G ) 1 d(v i G ) + 1) + (d(v i G ) )(d(v i G ) 1) + (d(v i 1 G ) )(d(v i G ) 1) 0. Then for any e C 1, we have LM (e G ) LM (h(e) G ). Now for e E 1, we have d (v i G )d (v i+1 G ) = (d(v i+1 G ) + d(v i 1 G ) )(d(v i G ) + d(v i+ G ) ), and d (v i G )d (v i+1 G ) = (d(v i+1 G ) + d(v i G ) )(d(v i G ) + d(v i+ G ) ) = (d(v i+1 G ) + d(v i G ) )(d(v i G ) + d(v i 1 G ) + d(v i+ G ) ). Let 3 = d (v i G )d (v i+1 G ) d (v i G )d (v i+1 G ). Then 3 = (d(v i+1 G ) )(d(v i 1 G ) ) + (d(v i G ) d(v i 1 G ))(d(v i G ) + d(v i+1 G ) ) d(v i G )(d(v i 1 G ) ) (d(v i G ) d(v i 1 G ))(d(v i G ) + d(v i+1 G ) ).

14 19 Leap Zagreb Indices of Trees and Unicyclic Graphs If d(v i G ) d(v i 1 G ) < 0, then (d(v i G ) d(v i 1 G ))(d(v i G ) + d(v i+1 G ) ) < 0. If d(v i G ) d(v i 1 G ) > 0, then 3 (d(v i G ) d(v i 1 G ))(d(v i G ) + d(v i+1 G ) ) ( d(vi 1 G ) d(v i G ) + d(v i G ) + d(v i+1 G ) ( d(vi G ) + d(v i+1 G ) ( ) ) n. ) As above, for e E 1, ( ) n LM (e G ) LM (e G ). Now we have LM (v i v i 1 G ) = (d(v i 1 G ) + d(v i+1 G ) )(d(v i G ) + d(v i G ) ) ( d(vi 1 G ) + d(v i+1 G ) + d(v i G ) + d(v i G ) 4 ( ) n. ) Finally, it is clear that for any e D 1 LM (e G ) LM (h(e) G ). (6)

15 Z. Shao, I. Gutman, Z. Li, S. Wang, P. Wu 193 Since E(G ) = A 1 B 1 D 1 {v i 1 v i }, together with Eqs. (5) (6) we obtain LM (G ) = LM (e G ) + LM (e G ) + LM (e G ) e A 1 e B 1 e D 1 LM (e G ) + LM (v i v i+1 G ) + LM (v i v i 1 G ) e C 1 + LM (e G ) + LM (e G ) + LM (e G ) e A e B e D LM (e G ) + LM (v i v i+1 G ) + LM (v i v i+1 G ) e C + LM (v i v i+1 G ) + LM (v i v i 1 G ) ( ) ( n n LM (G ) + + ) < g(n 1) + n n 1 3 g(n), (apply induction assumption Eq. (4)) contradicting to the assumption made on the graph G. By this, the proof of Theorem 5 is completed. In a manner analogous to the proof of Theorem 5 we can establish the following: Theorem 6. Let G be an n-vertex unicyclic graph with n 6. Then 4n 8 LM 3(G) (n 3)(n + ), where r, s, t are positive integers such that r + s + t + 3 = n. The left equality holds if and only if G = T P n and the right equality holds if and only if G = T r,s,t for r, s, t 0. References [1] A. Ali and N. Trinajstić, A novel/old modification of the first zagreb index, Mol. Inf. 37 (018), no. 6/7, Article ID: [] B. Borovicanin, K.C. Das, B. Furtula, and I. Gutman, Bounds for Zagreb indices, MATCH Commun. Math. Comput. Chem 78 (017), no. 1, [3] J.C. Dearden, The Use of Topological Indices in QSAR and QSPR Modeling, Advances in QSAR Modeling, Springer, Cham, 017, pp [4] J. Devillers and A.T. Balaban (Eds.), Topological Indices and Related Descriptors in QSAR and QSPAR, Gordon & Breach, Amsterdam, 000.

16 194 Leap Zagreb Indices of Trees and Unicyclic Graphs [5] I. Gutman, E. Milovanović, and I. Milovanović, Beyond the zagreb indices, AKCE Int. J. Graphs Combin. (018), in press. [6] I. Gutman, B. Ruščić, N. Trinajstić, and C.F. Wilcox, Graph theory and molecular orbitals. XII. acyclic polyenes, J. Chem. Phys. 6 (1975), no. 9, [7] I. Gutman and N. Trinajstić, Graph theory and molecular orbitals. Total ϕ- electron energy of alternant hydrocarbons, Chem. Phys. Lett. 17 (197), no. 4, [8] A.M. Naji and N.D. Soner, The first leap zagreb index of some graph opertations, Int. J. Appl. Graph Theory (018), no., [9] A.M. Naji, N.D. Soner, and I. Gutman, The first leap zagreb index of some graph opertations, Commun. Comb. Optim. (017), no., [10] N.D. Soner and A.M. Naji, The k-distance neighborhood polynomial of a graph, Int. J. Math. Comput. Sci. 3 (016), no. 9, [11] R. Todeschini and V. Consonni, Molecular Descriptors for Chemoinformatics, Wiley VCH, Weinheim, 009. [1] S. Yamaguchi, Estimating the zagreb indices and the spectral radius of triangleand quadrangle-free connected graphs, Chem. Phys. Lett. 458 (008), no. 4-6,

CCO Commun. Comb. Optim.

CCO Commun. Comb. Optim. Communications in Combinatorics and Optimization Vol. 1 No. 2, 2016 pp.137-148 DOI: 10.22049/CCO.2016.13574 CCO Commun. Comb. Optim. On trees and the multiplicative sum Zagreb index Mehdi Eliasi and Ali

More information

A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX

A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX AKBAR ALI 1 AND NENAD TRINAJSTIĆ arxiv:1705.1040v1 [math.co] 0 May 017 Abstract. In the paper [Gutman, I.; Trinajstić, N. Chem. Phys. Lett. 197, 17, 55],

More information

COUNTING RELATIONS FOR GENERAL ZAGREB INDICES

COUNTING RELATIONS FOR GENERAL ZAGREB INDICES Kragujevac Journal of Mathematics Volume 38(1) (2014), Pages 95 103. COUNTING RELATIONS FOR GENERAL ZAGREB INDICES G. BRITTO ANTONY XAVIER 1, E. SURESH 2, AND I. GUTMAN 3 Abstract. The first and second

More information

(Received: 19 October 2018; Received in revised form: 28 November 2018; Accepted: 29 November 2018; Available Online: 3 January 2019)

(Received: 19 October 2018; Received in revised form: 28 November 2018; Accepted: 29 November 2018; Available Online: 3 January 2019) Discrete Mathematics Letters www.dmlett.com Discrete Math. Lett. 1 019 1 5 Two upper bounds on the weighted Harary indices Azor Emanuel a, Tomislav Došlić b,, Akbar Ali a a Knowledge Unit of Science, University

More information

Extremal trees with fixed degree sequence for atom-bond connectivity index

Extremal trees with fixed degree sequence for atom-bond connectivity index Filomat 26:4 2012), 683 688 DOI 10.2298/FIL1204683X Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal trees with fixed degree

More information

Discrete Applied Mathematics

Discrete Applied Mathematics iscrete Applied Mathematics 57 009 68 633 Contents lists available at Scienceirect iscrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On reciprocal complementary Wiener number Bo

More information

On the harmonic index of the unicyclic and bicyclic graphs

On the harmonic index of the unicyclic and bicyclic graphs On the harmonic index of the unicyclic and bicyclic graphs Yumei Hu Tianjin University Department of Mathematics Tianjin 30007 P. R. China huyumei@tju.edu.cn Xingyi Zhou Tianjin University Department of

More information

arxiv: v1 [cs.dm] 9 Jun 2011

arxiv: v1 [cs.dm] 9 Jun 2011 On the Zagreb Indices Equality Hosam Abdo a, Darko Dimitrov a, Ivan Gutman b arxiv:1106.1809v1 [cs.dm] 9 Jun 011 a Institut für Informatik, Freie Universität Berlin, Takustraße 9, D 14195 Berlin, Germany

More information

RELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS

RELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS Kragujevac J. Sci. 30 (2008) 57-64. UDC 541.61 57 RELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS Slavko Radenković and Ivan Gutman Faculty of Science, P. O. Box 60, 34000 Kragujevac, Republic of Serbia

More information

On the Inverse Sum Indeg Index

On the Inverse Sum Indeg Index On the Inverse Sum Indeg Index Jelena Sedlar a, Dragan Stevanović b,c,, Alexander Vasilyev c a University of Split, Faculty of Civil Engineering, Matice Hrvatske 15, HR-21000 Split, Croatia b Mathematical

More information

Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges

Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges Graphs and Combinatorics (2014) 30:109 118 DOI 10.1007/s00373-012-1258-8 ORIGINAL PAPER Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges Shubo Chen Weijun Liu Received: 13 August 2009

More information

MULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction

MULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 21-29. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir MULTIPLICATIVE ZAGREB ECCENTRICITY

More information

On a Class of Distance Based Molecular Structure Descriptors

On a Class of Distance Based Molecular Structure Descriptors On a Class of Distance Based Molecular Structure Descriptors Franka Miriam Brückler a, Tomislav Došlić b, Ante Graovac c, Ivan Gutman d, a Department of Mathematics, University of Zagreb, Bijenička 30,

More information

THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER

THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic

More information

Estimating the Spectral Radius of a Graph by the Second Zagreb Index

Estimating the Spectral Radius of a Graph by the Second Zagreb Index Estimating the Spectral Radius of a Graph by the Second Zagreb Index Hosam Abdo, Darko Dimitrov Institute of Computer Science, Freie Universität Berlin, Takustraße 9, D 14195 Berlin, Germany abdo@mi.fu-berlin.de,

More information

GLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction

GLOBAL MINUS DOMINATION IN GRAPHS. Communicated by Manouchehr Zaker. 1. Introduction Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 35-44. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir GLOBAL MINUS DOMINATION IN

More information

arxiv: v1 [math.co] 6 Feb 2011

arxiv: v1 [math.co] 6 Feb 2011 arxiv:1102.1144v1 [math.co] 6 Feb 2011 ON SUM OF POWERS OF LAPLACIAN EIGENVALUES AND LAPLACIAN ESTRADA INDEX OF GRAPHS Abstract Bo Zhou Department of Mathematics, South China Normal University, Guangzhou

More information

Kragujevac J. Sci. 33 (2011) UDC : ZAGREB POLYNOMIALS OF THORN GRAPHS. Shuxian Li

Kragujevac J. Sci. 33 (2011) UDC : ZAGREB POLYNOMIALS OF THORN GRAPHS. Shuxian Li Kragujevac J. Sci. 33 (2011) 33 38. UDC 541.27:541.61 ZAGREB POLYNOMIALS OF THORN GRAPHS Shuxian Li Department of Mathematics, South China Normal University, Guangzhou 510631, China e-mail: lishx1002@126.com

More information

Some properties of the first general Zagreb index

Some properties of the first general Zagreb index AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 285 294 Some properties of the first general Zagreb index Muhuo Liu Bolian Liu School of Mathematic Science South China Normal University Guangzhou

More information

Extremal Topological Indices for Graphs of Given Connectivity

Extremal Topological Indices for Graphs of Given Connectivity Filomat 29:7 (2015), 1639 1643 DOI 10.2298/FIL1507639T Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal Topological Indices

More information

The Linear Chain as an Extremal Value of VDB Topological Indices of Polyomino Chains

The Linear Chain as an Extremal Value of VDB Topological Indices of Polyomino Chains Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5133-5143 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46507 The Linear Chain as an Extremal Value of VDB Topological Indices of

More information

On the Leap Zagreb Indices of Generalized xyz-point-line Transformation Graphs T xyz (G) when z = 1

On the Leap Zagreb Indices of Generalized xyz-point-line Transformation Graphs T xyz (G) when z = 1 International J.Math. Combin. Vol.(018), 44-66 On the Leap Zagreb Indices of Generalized xyz-point-line Transformation Graphs T xyz (G) when z 1 B. Basavanagoud and Chitra E. (Department of Mathematics,

More information

A Survey on Comparing Zagreb Indices

A Survey on Comparing Zagreb Indices MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (2011) 581-593 ISSN 0340-6253 A Survey on Comparing Zagreb Indices Bolian Liu and Zhifu You School of

More information

More on Zagreb Coindices of Composite Graphs

More on Zagreb Coindices of Composite Graphs International Mathematical Forum, Vol. 7, 2012, no. 14, 669-673 More on Zagreb Coindices of Composite Graphs Maolin Wang and Hongbo Hua Faculty of Mathematics and Physics Huaiyin Institute of Technology

More information

A new version of Zagreb indices. Modjtaba Ghorbani, Mohammad A. Hosseinzadeh. Abstract

A new version of Zagreb indices. Modjtaba Ghorbani, Mohammad A. Hosseinzadeh. Abstract Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Filomat 26:1 2012, 93 100 DOI: 10.2298/FIL1201093G A new version of Zagreb indices Modjtaba

More information

On the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China

On the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China Journal of Mathematical Chemistry Vol. 38, No. 3, October 005 ( 005) DOI: 0.007/s090-005-584-7 On the Randić index Huiqing Liu School of Mathematics and Computer Science, Hubei University, Wuhan 43006,

More information

arxiv: v1 [math.co] 5 Sep 2016

arxiv: v1 [math.co] 5 Sep 2016 Ordering Unicyclic Graphs with Respect to F-index Ruhul Amin a, Sk. Md. Abu Nayeem a, a Department of Mathematics, Aliah University, New Town, Kolkata 700 156, India. arxiv:1609.01128v1 [math.co] 5 Sep

More information

Solutions to Unsolved Problems on the Minimal Energies of Two Classes of Graphs

Solutions to Unsolved Problems on the Minimal Energies of Two Classes of Graphs MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (2011) 943-958 ISSN 0340-6253 Solutions to Unsolved Problems on the Minimal Energies of Two Classes of

More information

Wiener Index of Graphs and Their Line Graphs

Wiener Index of Graphs and Their Line Graphs JORC (2013) 1:393 403 DOI 10.1007/s40305-013-0027-6 Wiener Index of Graphs and Their Line Graphs Xiaohai Su Ligong Wang Yun Gao Received: 9 May 2013 / Revised: 26 August 2013 / Accepted: 27 August 2013

More information

Hexagonal Chains with Segments of Equal Lengths Having Distinct Sizes and the Same Wiener Index

Hexagonal Chains with Segments of Equal Lengths Having Distinct Sizes and the Same Wiener Index MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 78 (2017) 121-132 ISSN 0340-6253 Hexagonal Chains with Segments of Equal Lengths Having Distinct Sizes and

More information

Extremal Graphs with Respect to the Zagreb Coindices

Extremal Graphs with Respect to the Zagreb Coindices MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (011) 85-9 ISSN 0340-653 Extremal Graphs with Respect to the Zagreb Coindices A. R. Ashrafi 1,3,T.Došlić,A.Hamzeh

More information

Relation Between Randić Index and Average Distance of Trees 1

Relation Between Randić Index and Average Distance of Trees 1 MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (011) 605-61 ISSN 0340-653 Relation Between Randić Index and Average Distance of Trees 1 Marek Cygan,

More information

Estimating Some General Molecular Descriptors of Saturated Hydrocarbons

Estimating Some General Molecular Descriptors of Saturated Hydrocarbons Estimating Some General Molecular Descriptors of Saturated Hydrocarbons Akbar Ali, Zhibin Du, Kiran Shehzadi arxiv:1812.11115v1 [math.co] 28 Dec 2018 Knowledge Unit of Science, University of Management

More information

arxiv: v1 [math.co] 3 Jul 2017

arxiv: v1 [math.co] 3 Jul 2017 ON THE EXTREMAL GRAPHS WITH RESPECT TO BOND INCIDENT DEGREE INDICES AKBAR ALI a AND DARKO DIMITROV b arxiv:1707.00733v1 [math.co] 3 Jul 2017 Abstract. Many existing degree based topological indices can

More information

Topological indices: the modified Schultz index

Topological indices: the modified Schultz index Topological indices: the modified Schultz index Paula Rama (1) Joint work with Paula Carvalho (1) (1) CIDMA - DMat, Universidade de Aveiro The 3rd Combinatorics Day - Lisboa, March 2, 2013 Outline Introduction

More information

Redefined Zagreb, Randic, Harmonic and GA Indices of Graphene

Redefined Zagreb, Randic, Harmonic and GA Indices of Graphene International Journal of Mathematical Analysis Vol. 11, 2017, no. 10, 493-502 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7454 Redefined Zagreb, Randic, Harmonic and GA Indices of Graphene

More information

Counting the average size of Markov graphs

Counting the average size of Markov graphs JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org /JOURNALS / JOURNAL Vol. 7(207), -6 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

More information

A lower bound for the harmonic index of a graph with minimum degree at least two

A lower bound for the harmonic index of a graph with minimum degree at least two Filomat 7:1 013), 51 55 DOI 10.98/FIL1301051W Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A lower bound for the harmonic index

More information

arxiv: v1 [math.co] 13 Mar 2018

arxiv: v1 [math.co] 13 Mar 2018 A note on polyomino chains with extremum general sum-connectivity index Akbar Ali, Tahir Idrees arxiv:1803.04657v1 [math.co] 13 Mar 2018 Knowledge Unit of Science, University of Management & Technology,

More information

D-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS

D-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS 123 Kragujevac J. Math. 32 (2009) 123 131. D-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS Gopalapillai Indulal 1 and Ivan Gutman 2 1 Department of Mathematics, St. Aloysius College, Edathua, Alappuzha 689573,

More information

Some Remarks on the Arithmetic Geometric Index

Some Remarks on the Arithmetic Geometric Index Iranian J. Math. Chem. 9 (2) June (2018) 113 120 Iranian Journal of Mathematical Chemistry n Journal homepage: ijmc.kashanu.ac.ir Some Remarks on the Arithmetic Geometric Index JOSE LUIS PALACIOS Department

More information

Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26

Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26 Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.

More information

The smallest Randić index for trees

The smallest Randić index for trees Proc. Indian Acad. Sci. (Math. Sci.) Vol. 123, No. 2, May 2013, pp. 167 175. c Indian Academy of Sciences The smallest Randić index for trees LI BINGJUN 1,2 and LIU WEIJUN 2 1 Department of Mathematics,

More information

On the Geometric Arithmetic Index

On the Geometric Arithmetic Index MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun Math Comput Chem 74 (05) 03-0 ISSN 0340-653 On the Geometric Arithmetic Index José M Rodríguez a, José M Sigarreta b a Departamento

More information

BoundsonVertexZagrebIndicesofGraphs

BoundsonVertexZagrebIndicesofGraphs Global Journal of Science Frontier Research: F Mathematics and Decision Sciences Volume 7 Issue 6 Version.0 Year 07 Type : Double Blind Peer Reviewed International Research Journal Publisher: Global Journals

More information

Energy of a polynomial and the Coulson integral formula

Energy of a polynomial and the Coulson integral formula J Math Chem (21) 48:162 168 DOI 1.17/s191-1-9725-z ORIGINAL PAPER Energy of a polynomial and the Coulson integral formula Miodrag Mateljević Vladimir Božin Ivan Gutman Received: 3 November 29 / Accepted:

More information

2-bondage in graphs. Marcin Krzywkowski*

2-bondage in graphs. Marcin Krzywkowski* International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling

More information

arxiv: v1 [math.co] 7 Nov 2018

arxiv: v1 [math.co] 7 Nov 2018 DP-4-COLORABILITY OF TWO CLASSES OF PLANAR GRAPHS LILY CHEN 1 AND RUNRUN LIU 2 AND GEXIN YU 2, AND REN ZHAO 1 AND XIANGQIAN ZHOU 1,4 arxiv:1811.02920v1 [math.co] Nov 2018 1 School of Mathematical Sciences,

More information

arxiv: v1 [math.co] 12 Jul 2011

arxiv: v1 [math.co] 12 Jul 2011 On augmented eccentric connectivity index of graphs and trees arxiv:1107.7v1 [math.co] 1 Jul 011 Jelena Sedlar University of Split, Faculty of civil engeneering, architecture and geodesy, Matice hrvatske

More information

THE HARMONIC INDEX OF EDGE-SEMITOTAL GRAPHS, TOTAL GRAPHS AND RELATED SUMS

THE HARMONIC INDEX OF EDGE-SEMITOTAL GRAPHS, TOTAL GRAPHS AND RELATED SUMS Kragujevac Journal of Mathematics Volume 08, Pages 7 8. THE HARMONIC INDEX OF EDGE-SEMITOTAL GRAPHS, TOTAL GRAPHS AND RELATED SUMS B. N. ONAGH Abstract. For a connected graph G, there are several related

More information

Double domination edge removal critical graphs

Double domination edge removal critical graphs AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 48 (2010), Pages 285 299 Double domination edge removal critical graphs Soufiane Khelifi Laboratoire LMP2M, Bloc des laboratoires Université demédéa Quartier

More information

Bulletin of the Iranian Mathematical Society

Bulletin of the Iranian Mathematical Society ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei

More information

THE EDGE VERSIONS OF THE WIENER INDEX

THE EDGE VERSIONS OF THE WIENER INDEX MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 61 (2009) 663-672 ISSN 0340-6253 THE EDGE VERSIONS OF THE WIENER INDEX Ali Iranmanesh, a Ivan Gutman, b

More information

An Ore-type Condition for Cyclability

An Ore-type Condition for Cyclability Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG

More information

arxiv: v1 [math.co] 17 Apr 2018

arxiv: v1 [math.co] 17 Apr 2018 On extremal cacti with respect to the edge revised Szeged index arxiv:180.06009v1 [math.co] 17 Apr 2018 Shengjie He a, Rong-Xia Hao a, Deming Li b a Department of Mathematics, Beijing Jiaotong University,

More information

On the difference between the revised Szeged index and the Wiener index

On the difference between the revised Szeged index and the Wiener index On the difference between the revised Szeged index and the Wiener index Sandi Klavžar a,b,c M J Nadjafi-Arani d June 3, 01 a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia sandiklavzar@fmfuni-ljsi

More information

On Modular Colorings of Caterpillars

On Modular Colorings of Caterpillars On Modular Colorings of Caterpillars Futaba Okamoto Mathematics Department University of Wisconsin - La Crosse La Crosse, WI 546 Ebrahim Salehi Department of Mathematical Sciences University of Nevada

More information

Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture

Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa

More information

AALBORG UNIVERSITY. Merrifield-Simmons index and minimum number of independent sets in short trees

AALBORG UNIVERSITY. Merrifield-Simmons index and minimum number of independent sets in short trees AALBORG UNIVERSITY Merrifield-Simmons index and minimum number of independent sets in short trees by Allan Frendrup, Anders Sune Pedersen, Alexander A. Sapozhenko and Preben Dahl Vestergaard R-2009-03

More information

Vertices contained in all or in no minimum k-dominating sets of a tree

Vertices contained in all or in no minimum k-dominating sets of a tree AKCE Int. J. Graphs Comb., 11, No. 1 (2014), pp. 105-113 Vertices contained in all or in no minimum k-dominating sets of a tree Nacéra Meddah and Mostafa Blidia Department of Mathematics University of

More information

Domination and Total Domination Contraction Numbers of Graphs

Domination and Total Domination Contraction Numbers of Graphs Domination and Total Domination Contraction Numbers of Graphs Jia Huang Jun-Ming Xu Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026, China Abstract In this

More information

Maximising the number of induced cycles in a graph

Maximising the number of induced cycles in a graph Maximising the number of induced cycles in a graph Natasha Morrison Alex Scott April 12, 2017 Abstract We determine the maximum number of induced cycles that can be contained in a graph on n n 0 vertices,

More information

The Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size

The Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of

More information

Mathematical model for determining octanol-water partition coeffi cient of alkanes

Mathematical model for determining octanol-water partition coeffi cient of alkanes Mathematical model for determining octanol-water partition coeffi cient of alkanes Jelena Sedlar University of Split, Croatia 2nd Croatian Combinatorial Days, Zagreb, Croatia September 27-28, 2018 Jelena

More information

THE RAINBOW DOMINATION NUMBER OF A DIGRAPH

THE RAINBOW DOMINATION NUMBER OF A DIGRAPH Kragujevac Journal of Mathematics Volume 37() (013), Pages 57 68. THE RAINBOW DOMINATION NUMBER OF A DIGRAPH J. AMJADI 1, A. BAHREMANDPOUR 1, S. M. SHEIKHOLESLAMI 1, AND L. VOLKMANN Abstract. Let D = (V,

More information

Graphs with few total dominating sets

Graphs with few total dominating sets Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph

More information

On spectral radius and energy of complete multipartite graphs

On spectral radius and energy of complete multipartite graphs Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn., ISSN 1855-3974 (electronic edn. ARS MATHEMATICA CONTEMPORANEA 9 (2015 109 113 On spectral radius and energy of complete multipartite

More information

On the general sum-connectivity index and general Randić index of cacti

On the general sum-connectivity index and general Randić index of cacti Akhter et al. Journal of Inequalities and Applications (2016) 2016:300 DOI 10.1186/s13660-016-1250-6 R E S E A R C H Open Access On the general sum-connectivity index and general Randić index of cacti

More information

Communicated by Alireza Abdollahi. 1. Introduction. For a set S V, the open neighborhood of S is N(S) = v S

Communicated by Alireza Abdollahi. 1. Introduction. For a set S V, the open neighborhood of S is N(S) = v S Transactions on Combinatorics ISSN print: 2251-8657, ISSN on-line: 2251-8665 Vol. 01 No. 2 2012, pp. 49-57. c 2012 University of Isfahan www.combinatorics.ir www.ui.ac.ir ON THE VALUES OF INDEPENDENCE

More information

ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS

ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,

More information

Bicyclic digraphs with extremal skew energy

Bicyclic digraphs with extremal skew energy Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional

More information

Zagreb indices of block-edge transformation graphs and their complements

Zagreb indices of block-edge transformation graphs and their complements Indonesian Journal of Combinatorics 1 () (017), 64 77 Zagreb indices of block-edge transformation graphs and their complements Bommanahal Basavanagoud a, Shreekant Patil a a Department of Mathematics,

More information

Nowhere-zero 3-flows in triangularly connected graphs

Nowhere-zero 3-flows in triangularly connected graphs Nowhere-zero 3-flows in triangularly connected graphs Genghua Fan 1, Hongjian Lai 2, Rui Xu 3, Cun-Quan Zhang 2, Chuixiang Zhou 4 1 Center for Discrete Mathematics Fuzhou University Fuzhou, Fujian 350002,

More information

Transactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 4 No. 2 (2015), pp c 2015 University of Isfahan

Transactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 4 No. 2 (2015), pp c 2015 University of Isfahan Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 2 (2015), pp. 1-11. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir UNICYCLIC GRAPHS WITH STRONG

More information

K-DOMINATION ON HEXAGONAL CACTUS CHAINS

K-DOMINATION ON HEXAGONAL CACTUS CHAINS Kragujevac Journal of Mathematics Volume 36 Number (01), Pages 335 347. K-DOMINATION ON HEXAGONAL CACTUS CHAINS SNJE ZANA MAJSTOROVIĆ 1, TOMISLAV DO SLIĆ, AND ANTOANETA KLOBU CAR 3 Abstract. In this paper

More information

Even Cycles in Hypergraphs.

Even Cycles in Hypergraphs. Even Cycles in Hypergraphs. Alexandr Kostochka Jacques Verstraëte Abstract A cycle in a hypergraph A is an alternating cyclic sequence A 0, v 0, A 1, v 1,..., A k 1, v k 1, A 0 of distinct edges A i and

More information

THE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH

THE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 4, 2016 THE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH HONG-HAI LI AND LI ZOU ABSTRACT. The matching energy of a graph was introduced

More information

Analogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph

Analogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph Analogies and discrepancies between the vertex cover number and the weakly connected domination number of a graph M. Lemańska a, J. A. Rodríguez-Velázquez b, Rolando Trujillo-Rasua c, a Department of Technical

More information

Improved bounds on the difference between the Szeged index and the Wiener index of graphs

Improved bounds on the difference between the Szeged index and the Wiener index of graphs Improved bounds on the difference between the Szeged index and the Wiener index of graphs Sandi Klavžar a,b,c M. J. Nadjafi-Arani d October 5, 013 a Faculty of Mathematics and Physics, University of Ljubljana,

More information

Iranian Journal of Mathematical Chemistry, Vol. 4, No.1, March 2013, pp On terminal Wiener indices of kenograms and plerograms

Iranian Journal of Mathematical Chemistry, Vol. 4, No.1, March 2013, pp On terminal Wiener indices of kenograms and plerograms Iranian Journal of Mathematical Chemistry, Vol. 4, No.1, March 013, pp. 77 89 IJMC On terminal Wiener indices of kenograms and plerograms I. GUTMAN a,, B. FURTULA a, J. TOŠOVIĆ a, M. ESSALIH b AND M. EL

More information

New Lower Bounds for the First Variable Zagreb Index

New Lower Bounds for the First Variable Zagreb Index arxiv:1806.02063v1 [math.co] 6 Jun 2018 New Lower Bounds for the First Variable Zagreb Index Alvaro Martínez-Pérez a, José M. Rodríguez b June 7, 2018 a Facultad de Ciencias Sociales, Universidad de Castilla-La

More information

arxiv: v1 [math.co] 17 Feb 2017

arxiv: v1 [math.co] 17 Feb 2017 Properties of the Hyper-Wiener index as a local function arxiv:170.05303v1 [math.co] 17 Feb 017 Ya-Hong Chen 1,, Hua Wang 3, Xiao-Dong Zhang 1 1 Department of Mathematics, Lishui University Lishui, Zhejiang

More information

Better bounds for k-partitions of graphs

Better bounds for k-partitions of graphs Better bounds for -partitions of graphs Baogang Xu School of Mathematics, Nanjing Normal University 1 Wenyuan Road, Yadong New District, Nanjing, 1006, China Email: baogxu@njnu.edu.cn Xingxing Yu School

More information

The multiplicative Zagreb indices of graph operations

The multiplicative Zagreb indices of graph operations Das et al Journal of Inequalities and Applications 0, 0:90 R E S E A R C H Open Access The multiplicative Zagreb indices of graph operations Kinkar C Das, Aysun Yurttas,MugeTogan, Ahmet Sinan Cevik and

More information

LAPLACIAN ESTRADA INDEX OF TREES

LAPLACIAN ESTRADA INDEX OF TREES MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (009) 769-776 ISSN 0340-653 LAPLACIAN ESTRADA INDEX OF TREES Aleksandar Ilić a and Bo Zhou b a Faculty

More information

Research Article. Generalized Zagreb index of V-phenylenic nanotubes and nanotori

Research Article. Generalized Zagreb index of V-phenylenic nanotubes and nanotori Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2015, 7(11):241-245 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Generalized Zagreb index of V-phenylenic nanotubes

More information

ON GLOBAL DOMINATING-χ-COLORING OF GRAPHS

ON GLOBAL DOMINATING-χ-COLORING OF GRAPHS - TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst

More information

A class of trees and its Wiener index.

A class of trees and its Wiener index. A class of trees and its Wiener index. Stephan G. Wagner Department of Mathematics Graz University of Technology Steyrergasse 3, A-81 Graz, Austria wagner@finanz.math.tu-graz.ac.at Abstract In this paper,

More information

Extremal Kirchhoff index of a class of unicyclic graph

Extremal Kirchhoff index of a class of unicyclic graph South Asian Journal of Mathematics 01, Vol ( 5): 07 1 wwwsajm-onlinecom ISSN 51-15 RESEARCH ARTICLE Extremal Kirchhoff index of a class of unicyclic graph Shubo Chen 1, Fangli Xia 1, Xia Cai, Jianguang

More information

THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2

THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2 LE MATEMATICHE Vol LXVIII (2013) Fasc II, pp 167 190 doi: 104418/201368213 THE RADIO NUMBERS OF ALL GRAPHS OF ORDER n AND DIAMETER n 2 K F BENSON - M PORTER - M TOMOVA A radio labeling of a simple connected

More information

The PI Index of the Deficient Sunflowers Attached with Lollipops

The PI Index of the Deficient Sunflowers Attached with Lollipops Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 41, 001-007 The PI Index of the Deficient Sunflowers Attached with Lollipops Min Huang Institute of Mathematics Physics and Information Sciences Zhejiang

More information

On the Atom-Bond Connectivity Index of Cacti

On the Atom-Bond Connectivity Index of Cacti Filomat 8:8 (014), 1711 1717 DOI 10.98/FIL1408711D Publishe by Faculty of Sciences an Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Atom-Bon Connectivity Inex

More information

CCO Commun. Comb. Optim.

CCO Commun. Comb. Optim. Communications in Combinatorics and Optimization Vol. No. 1, 017 pp.35-1 DOI: 10.09/CCO.017.1359 CCO Commun. Comb. Optim. Sufficient conditions for maximally edge-connected and super-edge-connected graphs

More information

Predicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-degree and ve-degree Zagreb Indices

Predicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-degree and ve-degree Zagreb Indices International Journal of Systems Science and Applied Mathematics 2017; 2(5): 87-92 http://www.sciencepublishinggroup.com/j/ijssam doi: 10.11648/j.ijssam.20170205.12 ISSN: 2575-5838 (Print); ISSN: 2575-5803

More information

ON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER OR RADIUS

ON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER OR RADIUS MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2010) 91-100 ISSN 0340-6253 ON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER

More information

Laplacian Integral Graphs with Maximum Degree 3

Laplacian Integral Graphs with Maximum Degree 3 Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,

More information

On the Gutman index and minimum degree

On the Gutman index and minimum degree On the Gutman index and minimum degree Jaya Percival Mazorodze 1 Department of Mathematics University of Zimbabwe, Harare, Zimbabwe mazorodzejaya@gmail.com Simon Mukwembi School of Mathematics, Statistics

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,

More information

Enumeration of subtrees of trees

Enumeration of subtrees of trees Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical

More information

EQUITABLE COLORING OF SPARSE PLANAR GRAPHS

EQUITABLE COLORING OF SPARSE PLANAR GRAPHS EQUITABLE COLORING OF SPARSE PLANAR GRAPHS RONG LUO, D. CHRISTOPHER STEPHENS, AND GEXIN YU Abstract. A proper vertex coloring of a graph G is equitable if the sizes of color classes differ by at most one.

More information