A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX
|
|
- Curtis Gilbert
- 5 years ago
- Views:
Transcription
1 A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX AKBAR ALI 1 AND NENAD TRINAJSTIĆ arxiv: v1 [math.co] 0 May 017 Abstract. In the paper [Gutman, I.; Trinajstić, N. Chem. Phys. Lett. 197, 17, 55], it was shown that total π-electron energy (E) of a molecule M depends on the quantity v V (G) d v (nowadays known as the first Zagreb index), where G is the graph corresponding to M, V (G) is the vertex set of G and d v is degree of the vertex v. In the same paper, the graph invariant v V (G) d vτ v (where τ v is the connection number of v, that is the number of vertices at distance from v) was also proved to influence E, but this invariant was never restudied explicitly. We call it modified first Zagreb connection index and denote it by ZC1. In this paper, we characterize the extremal elements with respect to the graph invariant ZC1 among the collection of all n-vertex chemical trees. 1. Introduction It is well known fact that chemical compounds can be represented by graphs (known as molecular graphs) in which vertices correspond to the atoms while edges represent the covalent bonds between atoms 1,. In theoretical chemistry, the physicochemical properties of chemical compounds are often modeled by the topological indices,4. Topological indices are numerical quantities of molecular graph, which are invariant under graph isomorphism 4. In the paper 5, it was shown that the following topological indices appears in an approximate formula for total π-electron energy (E) of a molecule M: M 1 (G) = d v, ZC1(G) = d v τ v v V (G) v V (G) where G is the graph corresponding to the molecule M, V (G) is the vertex set of G, d v is degree of the vertex v and τ v is the connection number of v (that is, the number of vertices at distance from v). The topological index M 1 is known as the first Zagreb index. We call the topological index ZC 1 as modified first Zagreb connection index. The following topological index is called second Key words and phrases. topological index, Zagreb indices, chemical tree, vertex connection number. 1
2 AKBAR ALI 1 AND NENAD TRINAJSTIĆ Zagreb index: 5,6 M (G) = uv E(G) d u d v, where E(G) is the edge set of the graph G and uv is the edge between the vertices u, v. The first Zagreb index and second Zagreb index are among the oldest and most studied topological indices. More than a hundred papers have been devoted to these Zagreb indices, for example see the reviews 7 9 published on the occasion of their 0th anniversary, recent surveys 10,11, very recent papers 1 18 and related references cited therein. In contrast, the modified first Zagreb connection index did not attract attention in any of the numerous publications on topological indices till 016. The main purpose of the present study is to gather some basic properties of the modified first Zagreb connection index, and-especially-to characterize the extremal elements with respect to the aforementioned topological index among the collection of all n-vertex chemical trees.. Some Observations on the Modified First Zagreb Connection Index In this section, some basic properties of the modified first Zagreb connection index are established. As usual, the path graph, star graph and complete graph on n vertices will be denoted by P n, S n and K n, respectively. Undefined notations and terminologies from (chemical) graph theory can be found in the books 1,19,0. Suppose that the graph G has n 0 vertices with degree zero and let V 0 (G) be the set of these vertices. In the Reference 1, the following identity was derived: d u f(d u ) = (f(d u ) + f(d v )), (.1) u V (G)\V 0 (G) uv E(G) where f is a function defined on the set of vertex degrees of the graph G. The proof technique used in establishing the identity (.1) also works for deriving the following more general identity: d u g(u) = (g(u) + g(v)), (.) u V (G)\V 0 (G) uv E(G) where g is a function defined on the vertex set V (G). Hence, the modified first Zagreb connection index can be rewritten in the following form by setting g(u) = τ u in the identity (.): ZC1(G) = (τ u + τ v ). (.) uv E(G)
3 A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX In 008, Yamaguchi derived a lower bound (given in the following theorem) for the topological index M in which the quantity v V (G) d vτ v also appears: Theorem.1. If G is a connected graph, then M (G) 1 d v (d v + τ v ), (.4) v V (G) with equality if and only if G is a triangle- and quadrangle-free graph. Hence, if the graph under consideration is triangle- and quadrangle-free then the modified first Zagreb connection index can be written as the linear combination of the topological indices M 1 and M. Corollary.. If G is a triangle- and quadrangle-free graph, then ZC 1(G) = M (G) M 1 (G). (.5) Here, it needs to be mentioned that Xu et al. considered the linear combination M (G) M 1 (G) for any connected graph G. As there are many (lower and upper) bounds as well as relations for the topological indices M 1 and M in the literature. Hence, several bounds for the topological index ZC 1 can be easily established using Eq. (.5) in case of triangle- and quadrangle-free graphs. For instance, we derive an upper bound for the topological index ZC 1 using the following result which was reported in the references 7,4 : Theorem.. If G is an n-vertex graph with size m and minimum vertex degree δ then M (G) m (n 1)mδ + 1 (δ 1)M 1(G) with equality if and only if G = S n or G = K n. The upper bound for ZC 1, given in the following corollary, is a direct consequence of Theorem.: Corollary.4. If G is a triangle- and quadrangle-free graph with order n, size m and minimum vertex degree δ then ZC 1(G) 4m (n 1)mδ + (δ )M 1 (G) with equality if and only if G = S n.
4 4 AKBAR ALI 1 AND NENAD TRINAJSTIĆ. Modified First Zagreb Connection Index of chemical trees Denote by CT n the collection of all n-vertex chemical trees. This section is devoted to characterize the extremal elements with respect to the topological index ZC1 among the collection CT n. Note that the collection CT n consist of only a single element for n = 1,,. All the non-isomorphic members of of the collections CT 4, CT 5 and CT 6 (together with vertex connection numbers) are depicted in Figure 1 and their ZC1 values are given in Table 1. Note that both non-isomorphic trees on 4 vertices have the same ZC1 value. Hence, the before said problem concerning extremal chemical trees make sense only for n 5. Firstly, we characterize the chemical tree having minimum ZC1 value among the aforementioned collection for n 5. For a vertex u V (G), denote by N(u) (the neighborhood of u) the set of all vertices adjacent with u. A vertex having degree 1 is called pendent vertex. A pendent vertex adjacent with a vertex having degree greater than is called star-type pendent vertex. Theorem.1. For n 5, the path graph has minimum ZC 1 value among all the members of CT n. Proof. Simple calculations yield ZC 1(P n ) = 4n 10. The result will be proved by induction on n. For n = 5, there are only three non-isomorphic trees and hence the conclusion can be easily verified. Suppose that the result holds for all trees of order n 1 where n 6. Let T n be an n-vertex tree and u be its pendent vertex adjacent with the vertex v. Set d v = x and N(v) = {u = u 0, u 1, u,..., u r 1, u r,..., u x 1 } where d ui = 1 for 0 i r 1 and d ui for r i x 1. As T n is different from the star graph S n, so τ v 1. Let T n 1 be the tree obtained from T n by removing the vertex u. Then x 1 x 1 ZC1(T n ) = ZC1(T n 1 ) + d ui τ ui + d v τ v + τ u d ui (τ ui 1) (d v 1)τ v which is equivalent to i=1 x 1 ZC1(T n ) = ZC1(T n 1 ) + d ui + d v + τ v 1 (.1) Bearing in mind the facts τ v 1, d v, x 1 i=1 d u i and inductive hypothesis, from eq. (.1) we have ZC 1(T n ) ZC 1(T n 1 ) + 4 4(n 1) ZC 1(P n ). Observe that the equality ZC1(T n ) = ZC1(P n ) holds if and only if τ v = 1, d v =, d u1 = and T n 1 = Pn 1. This completes the proof. i=1 i=1
5 A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX 5 It can be easily noted that the proof of Theorem.1 remains valid if we replace the collection CT n with the collection of all n-vertex general trees different from the star graph S n, where n 5. Moreover, ZC 1(P n ) = 4n 10 < ZC 1(S n ) = (n 1)(n ) for all n 5. Hence, one has: Corollary.. For n 5, the path has minimum ZC 1 value among all n-vertex trees. Now, we prove some lemmas which will be used to characterize the trees with maximum ZC 1 value among the collection CT n. In the remaining part of this section, we will use the alternative formula of ZC 1, given in Eq. (.5). Lemma.. For n 5, if the tree T CT n has the maximum ZC1 value then T contains at most one vertex of degree. Proof. Suppose to the contrary that T contains more than one vertex of degree. Let u, v V (T ) such that d u = d v =. Let N(u) = {u 1, u } and N(v) = {v 1, v }. Suppose that the unique path connecting the vertices u and v contains the vertices u, v. Without loss of generality, we may assume that d u1 + d u d v1 + d v. Let T (1) be the tree obtained from T by removing the edge u 1 u and adding the edge u 1 v. There are two cases. Case 1. The vertices u and v are adjacent. That is, u = v and v = u. We calculate the value of the difference ZC1(T ) ZC1(T (1) ). If the vertex u 1 is pendent then the condition n 5 guaranties that d v1. Hence, whether the vertex u 1 is pendent or not, in both cases we have ZC 1(T ) ZC 1(T (1) ) = ( d u1 d v1 ) < 0, which is a contradiction the definition of T. Case. The vertices u and v are not adjacent. Bearing in mind the inequality d u1 + d u d v1 + d v, we have ZC 1(T ) ZC 1(T (1) ) = (d u d u1 d v1 d v + 1) < 0, which contradicts the maximality of ZC1(T ). In both cases, contradiction arises. Hence, T contains at most one vertex of degree. Lemma.4. For n 5, if the tree T CT n has the maximum ZC 1 value and T contains a vertex u of degree then one of the neighbors of u is pendent. Proof. Suppose to the contrary that both the neighbors of u, say u 1 and u, are non-pendent. Then, Lemma. suggests that both of the vertices u 1, u must have degree at least. Observe that all the pendent vertices of T are star-type.
6 6 AKBAR ALI 1 AND NENAD TRINAJSTIĆ Case 1. Neither of the vertices u 1, u has a pendent neighbor. Let w V (T ) be a pendent vertex adjacent with the vertex t V (T ). Suppose that T (1) is the tree obtained from T by removing the edges u 1 u, u u, wt and adding the edges u 1 u, wu, ut. Observe that both the trees T (1) and T have same degree sequence. Note that d u1 + d u d u1 d u, which implies that ZC 1(T ) ZC 1(T (1) ) = (d u1 + d u d u1 d u d t ) (1 d t ) < 0. This contradicts the maximality of ZC 1(T ). Case. At least one of the vertices u 1, u has a pendent neighbor. Without loss of generality, assume that u 1 is adjacent with a pendent vertex u 11 V (T ). Let T () be the tree obtained from T by removing the edges u 1 u, u u and adding the edges u 1 u, u 11 u. Bearing in mind the inequality d u1 + d u d u1 d u 0, one has ZC 1(T ) ZC 1(T () ) = (d u1 + d u d u1 d u ) < 0, which is again a contradiction. This completes the proof. Lemma.5. For n 7, if the tree T CT n has the maximum ZC1 value then T contains at most one vertex of degree. Proof. Suppose, contrarily, that T contains at least two vertices of degree. Let u, v V (T ) such that d u = d v =. Let N(u) = {u 1, u, u } and N(v) = {v 1, v, v }. Suppose that the unique path connecting the vertices u and v contains the vertices u, v. Without loss of generality, we may also assume that d u1 + d u + d u d v1 + d v + d v and d u1 d u. Let T (1) be the tree obtained from T by removing the edge u 1 u and adding the edge u 1 v. There are two cases. Case 1. The vertices u and v are adjacent. That is, u = v and v = u. If both the vertices u 1 and u are pendent then the assumption n 7 forces that at least one of the vertices v 1 and v must be non-pendent and hence ZC 1(T ) ZC 1(T (1) ) = ( + d u d u1 d v1 d v ) < 0, which is a contradiction. If at least one of the vertices u 1, u is non-pendent then d u1 (because d u1 d u ) and hence we have ZC 1(T ) ZC 1(T (1) ) = ( + d u d u1 d v1 d v ) again a contradiction. Case. The vertices u and v are not adjacent. ( + d u1 d u d u1 d u ) = 4(1 d u1 ) < 0,
7 In this case we have: A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX 7 ZC 1(T ) ZC 1(T (1) ) = (1 d u1 + d u + d u d v1 d v d v ). (.) From the inequality d u1 + d u + d u d v1 + d v + d v ZC 1(T ) ZC 1(T (1) ) (1 d u1 ) < 0, and eq.. it follows that which contradicts the maximality of ZC1(T ). In both cases, contradiction arises. Hence, T contains at most one vertex of degree. Lemma.6. For n 7, if the tree T CT n has the maximum ZC1 value then T does not contain vertices of degree and simultaneously. Proof. Suppose to the contrary that u, v V (T ) such that d u = and d v =. Let N(u) = {u 1, u } and N(v) = {v 1, v, v }. Suppose that the unique path connecting the vertices u and v contains the vertices u, v. Let T (1) be the tree obtained from T by removing the edge u 1 u and adding the edge u 1 v. There are two cases. Case 1. The vertices u and v are adjacent. That is, u = v and v = u. Note that the assumption n 7 implies that at least one of the vertices u 1, v 1, v must be non-pendent and hence ZC 1(T ) ZC 1(T (1) ) = (4 d u1 d v1 d v ) < 0, which is a contradiction. Case. The vertices u and v are not adjacent. By the virtue of Lemma. and Lemma.5, we have d v = 4 and hence ZC 1(T ) ZC 1(T (1) ) = ( + d u d u1 d v1 d v d v ) < 0, which contradicts the maximality of ZC 1(T ). This completes the proof. Lemma.7. For n 7, let the tree T CT n has the maximum ZC 1 value. If T contains a vertex u of degree then u has two pendent neighbors. Proof. Contrarily, suppose that u has at least two non-pendent neighbors. Let N(u) = {u 1, u, u }. Without loss of generality, we may assume that u 1, u are non-pendent. Then, due to Lemmas. -.6, both the vertices u 1, u have degree 4 and there must exist a vertex v V (T ) of degree 4 such that three neighbors of v are pendent. Let w be a pendent neighbor of v and suppose that T (1) is the tree obtained from T by removing the edge vw and adding the edge uw.
8 8 AKBAR ALI 1 AND NENAD TRINAJSTIĆ Case 1. The vertex v doest not belong to the set N(u). Let v 1 be the unique non-pendent neighbor of v. Then, simple calculations yield: ZC1(T ) ZC1(T (1) ) = (d v1 d u 6) < 0, which is a contradiction. Case. The vertex v belongs to the set N(u). Without loss of generality, we may assume that v = u 1. Then, we again have a contradiction as follows: This completes the proof. ZC 1(T ) ZC 1(T (1) ) = d u 4 < 0. For n 9 and n 0 (mod ), let CT (0) n be the collection of those n-vertex chemical trees in which one vertex has degree whose one neighbor is pendent, and every other vertex has degree 1 or 4. For n 7 and n 1 (mod ), let CT (1) n be the collection of those n-vertex chemical trees in which one vertex has degree whose two neighbors are pendent, and every other vertex has degree 4 or 1. For n 8 and n (mod ), let CT () n be the collection of those n-vertex chemical trees which consists of only vertices of degree 1 and 4. Let us take CT n = CT (0) n CT (1) n CT () n. Theorem.8. For n 7, the tree T CT n has maximum ZC 1 value if and only if T CT n. Proof. The result follows from Lemmas. -.7 and definition of the collection CT n. It is interesting to see that the n-vertex chemical trees having maximum M value 5 and maximum ZC1 value among the collection CT n are same for n 7 (it is not true for general trees). Denote by x a,b the number of edges in the graph G connecting the vertices of degrees a and b. Let n a be the number of vertices of degree a in the graph G. The following system of equations holds for all trees of the collection CT n. 4 n i = n (.) 1 i 4, i j i=1 4 i n i = (n 1) (.4) i=1 x j,i + x j,j = j n j ; j = 1,,, 4. (.5)
9 A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX 9 Eliminating n 1 from eq. (.) and eq. (.4): 4 (i 1) n i = n (.6) i= Corollary.9. For n 7, let T be any member of CT n. Then { ZC1(T 10(n 4) if n 0 (mod ) or n 1 (mod ), ) (5n 19) otherwise. The equality sign in the first inequality holds if and only if n 0 (mod ) and T CT (0) n, or n 1 (mod ) and T CT (1) n. The equality sign in the second inequality holds if and only if n (mod ) and T CT () Proof. Let T CT n and T CT n. Then, by virtue of Theorem.8, we have ZC1(T ) < ZC1(T ). Hence, to obtain the desired result, it is enough to calculate ZC1 value of T. If n 0 (mod ) then n = k where k. From eq. (.6), it follows that n + n 1 (mod ) which implies that n = 1, n = 0. Hence, from eq. (.) and eq. (.4) we have n 1 = k, n 4 = k 1. Also, note that x 1, = x,4 = 1. Now, from system (.5) we have x 1,4 = k 1, x 4,4 = k and hence ZC1(T ) = 10(n 4). In a similar way, we have: { ZC1(T 10(n 4) if n 1 (mod ), ) = (5n 19) if n (mod ). From the definitions of the collections CT (0) n, CT (1) n, CT () n, CT n and from Theorem.8, the desired result follows. For n = 5, 6, the trees having maximum ZC 1 value among all the members of CT n can be easily identified from Figure 1, using Table Concluding Remarks We have fully characterized the extremal chemical trees with fixed number of vertices for the topological index ZC1, which is occurred in an approximate formula for total π-electron energy, communicated in 197. The first Zagreb index M 1 can also be rewritten as M 1 (G) = (d u + d v ). (4.1) uv E(G) So, if we replace vertex degree by vertex connection number in eq. (4.1) we get the topological index ZC 1. Hence, it is natural to consider the following n.
10 10 AKBAR ALI 1 AND NENAD TRINAJSTIĆ connection-number versions of the Zagreb indices v V (G) d v and uv E(G) d ud v : ZC 1 (G) = τv and ZC (G) = τ u τ v, v V (G) uv E(G) respectively. We call ZC 1 as the first Zagreb connection index and ZC as the second Zagreb connection index. Moreover, the following bond incident connection-number (BIC) indices may be considered as a generalization of the Zagreb connection indices: BIC(G) = y a,b (G).φ a,b (4.) 0 a b n where y a,b (G) is the number of edges in G connecting the vertices with connection numbers a and b, and φ a,b is a non-negative real valued (symmetric) function which depends on a and b. References (1) Trinajstić, N. Chemical Graph Theory, nd revised ed. CRC Press, Boca Raton, Florida, (199). () Gutman, I.; Polansky, O. E. Mathematical Concepts in Organic Chemistry. Spinger, Berlin, (1986). () Todeschini, R.; Consonni, V. Molecular Descriptors for Chemoinformatics. Wiley-VCH, Weinheim, (009). (4) Gutman, I.; Furtula, B. (Eds.) Novel Molecular Structure DescriptorsTheory and Applications vols. I-II. Univ. Kragujevac, Kragujevac, (010). (5) Gutman, I.; Trinajstić, N. Chem. Phys. Lett. 197, 17, 55. (6) Gutman, I.; Ruščić, B.; Trinajstić, N.; Wilcox, C. F. J. Chem. Phys. 1975, 6, 99. (7) Das, K. C.,; Gutman, I. MATCH Commun. Math. Comput. Chem. 004, 5, 10. (8) Gutman, I.; Das, K.C. MATCH Commun. Math. Comput. Chem. 004, 50, 8. (9) Nikolić, S.; Kovačević, G,; Miličević, A.; Trinajstić, N. Croat. Chem. Acta 00, 76, 11. (10) Gutman, I. Croat. Chem. Acta 01, 86, 51. (11) Gutman, I.; Réti, T. Int. J. Chem. Model. 014, 6, 191. (1) Réti, T.; Felde, I. MATCH Commun. Math. Comput. Chem. 016, 76, 185. (1) Das, K. C.; Akgunes, N.; Togan, M.; Yurttas, A.; Cangul, I. N.; Cevik, A. S. An. St. Univ. Ovidius Constanta 016, 4, 15.
11 A NOVEL/OLD MODIFICATION OF THE FIRST ZAGREB INDEX 11 (14) Deng, H.; Sarala, D.; Ayyaswamy, S. K.; Balachandran, S. Appl. Math. Comp. 016, 75, 4. (15) Habibi, N.; Zadeh, T. D.,; Ashrafi, A. R. Transactions on Combinatorics 016, 5, 5. (16) Borovićanin, B.; Furtula, B. Appl. Math. Comp. 016, 79, 08. (17) Wang, H.; Yuan, S. Discrete Mathematics 016, 9, 11. (18) Lee, D. W.; Sedghi, S.; Shobe, N. Malaya J. Mat. 016, 4, 468. (19) Harary, F. Graph Theory. Addison-Wesley, Reading, MA, (1969). (0) Bondy, J. A.; Murty, U. S. R. Graph Theory with Applications. American Elsevier Publishing Co., Inc., New York, (1976). (1) Došlić, T.; Furtula, B.; Graovac, A.; Gutman, I.; Moradi, S.; Yarahmadi, Z. MATCH Commun. Math. Comput. Chem. 011, 66, 61. () Yamaguchi, S. Chem. Phys. Lett. 008, 458, 96. () Xu, K.; Klavžar, S; Das, K. C.; Wang, J. MATCH Commun. Math. Comput. Chem. 014, 7, 865. (4) Das, K. C.,; Gutman, I.; Zhou, B. J. Math. Chem. 009, 46, 514. (5) Vukićević, Z. K.; Popivoda, G. Iranian J. Math. Chem. 014, 5, Department of Mathematics, University of Management and Technology, Sialkot, Pakistan. address: akbarali.maths@gmail.com The Rugjer Bošković Institute, P. O. Box 180, HR-1000 Zagreb, Croatia. address: trina@irb.hr
12 1 AKBAR ALI 1 AND NENAD TRINAJSTIĆ (a) T 1 T (b) T T 4 T 5 0 (c) T 6 T 7 T 8 T 9 1 T 10 Figure 1. All the non-isomorphic chemical trees (together with vertex connection numbers) on (a) four vertices (b) five vertices (c) six vertices. Chemical Tree T i shown in Figure 1 T 1 T T T 4 T 5 T 6 T 7 T 8 T 9 T 10 The ZC1 Value of T i Table 1. The ZC1 values of the chemical trees depicted in Figure 1.
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 informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
More informationCCO 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(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 informationarxiv: 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 informationarxiv: 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 informationDiscrete 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 informationCOUNTING 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 informationZagreb 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 informationOn 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 informationOn 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 informationMULTIPLICATIVE 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 informationExtremal 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 informationA 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 informationExtremal 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 informationOn 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 informationarxiv: 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 informationThe 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 informationKragujevac 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 informationarxiv: 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 informationTHE 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 informationBoundsonVertexZagrebIndicesofGraphs
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 informationThe 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 informationSome 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 informationMore 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 informationThe Story of Zagreb Indices
The Story of Zagreb Indices Sonja Nikolić CSD 5 - Computers and Scientific Discovery 5 University of Sheffield, UK, July 0--3, 00 Sonja Nikolic sonja@irb.hr Rugjer Boskovic Institute Bijenicka cesta 54,
More informationHarary Index and Hamiltonian Property of Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 645-649 ISSN 0340-6253 Harary Index and Hamiltonian Property of Graphs Ting Zeng College of Mathematics
More informationExtremal 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 informationExtremal 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 informationTHE 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 informationResearch 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 informationUpper Bounds for the Modified Second Multiplicative Zagreb Index of Graph Operations Bommanahal Basavanagoud 1, a *, Shreekant Patil 2, b
Bulletin of Mathematical Sciences and Applications Submitted: 06-03- ISSN: 78-9634, Vol. 7, pp 0-6 Revised: 06-08-7 doi:0.805/www.scipress.com/bmsa.7.0 Accepted: 06-08-6 06 SciPress Ltd., Switzerland Online:
More informationHexagonal 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 informationIranian 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 informationTHE HOSOYA INDEX AND THE MERRIFIELD-SIMMONS INDEX OF SOME GRAPHS. Communicated by Alireza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN (print): 51-8657, ISSN (on-line): 51-8665 Vol 1 No (01), pp 51-60 c 01 University of Isfahan wwwcombinatoricsir wwwuiacir THE HOSOYA INDEX AND THE MERRIFIELD-SIMMONS
More informationSome Bounds on General Sum Connectivity Index
Some Bounds on General Sum Connectivity Index Yun Gao Department of Editorial, Yunnan Normal University, Kunming 65009, China, gy6gy@sinacom Tianwei Xu, Li Liang, Wei Gao School of Information Science
More informationA 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 informationTHE HARMONIC INDEX OF SUBDIVISION GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN print: 5-8657, ISSN on-line: 5-8665 Vol. 6 No. 07, pp. 5-7. c 07 University of Isfahan toc.ui.ac.ir www.ui.ac.ir THE HARMONIC INDEX OF SUBDIVISION GRAPHS BIBI NAIME ONAGH
More informationOn 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 informationOn 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 informationarxiv: 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 informationK-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 informationA 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 informationHOSOYA POLYNOMIAL OF THORN TREES, RODS, RINGS, AND STARS
Kragujevac J. Sci. 28 (2006) 47 56. HOSOYA POLYNOMIAL OF THORN TREES, RODS, RINGS, AND STARS Hanumappa B. Walikar, a Harishchandra S. Ramane, b Leela Sindagi, a Shailaja S. Shirakol a and Ivan Gutman c
More informationZagreb Indices: Extension to Weighted Graphs Representing Molecules Containing Heteroatoms*
CROATICA CHEMICA ACTA CCACAA 80 (3-4) 541 545 (2007) ISSN-0011-1643 CCA-3197 Original Scientific Paper Zagreb Indices: Extension to Weighted Graphs Representing Molecules Containing Heteroatoms* Du{anka
More informationSome 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 informationPaths and walks in acyclic structures: plerographs versus kenographs
Issue in onor of Prof. Alexander Balaban ARKIVO 2005 (x) 33-44 Paths and walks in acyclic structures: plerographs versus kenographs Damir Vukičević,* a Ante Miličević, b Sonja Nikolić, b Jelena Sedlar,
More informationarxiv: 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 informationarxiv: v1 [math.co] 14 May 2018
On Neighbourhood Zagreb index of product graphs Sourav Mondal a, Nilanjan De b, Anita Pal c arxiv:1805.05273v1 [math.co] 14 May 2018 Abstract a Department of mathematics, NIT Durgapur, India. b Department
More informationExtremal Values of Vertex Degree Topological Indices Over Hexagonal Systems
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (013) 501-51 ISSN 0340-653 Extremal Values of Vertex Degree Topological Indices Over Hexagonal Systems
More informationRELATION 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 informationA note on the Laplacian Estrada index of trees 1
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2009) 777-782 ISSN 0340-6253 A note on the Laplacian Estrada index of trees 1 Hanyuan Deng College of
More informationComputation of New Degree Based Topological Indices of Dutch Windmill Graph
Volume 117 No. 14 017, 35-41 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Computation of New Degree Based Topological Indices of Dutch Windmill
More informationHYPER ZAGREB INDEX OF BRIDGE AND CHAIN GRAPHS
Open J. Math. Sci., Vol. 2(2018), No. 1, pp. 1-17 ISSN 2523-0212 Website: http://www.openmathscience.com HYPER ZAGREB INDEX OF BRIDGE AND CHAIN GRAPHS NILANJAN DE 1 Abstract. Let G be a simple connected
More informationOn 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 informationOn trees with smallest resolvent energies 1
On trees with smallest resolvent energies 1 Mohammad Ghebleh, Ali Kanso, Dragan Stevanović Faculty of Science, Kuwait University, Safat 13060, Kuwait mamad@sci.kuniv.edu.kw, akanso@sci.kuniv.edu.kw, dragance106@yahoo.com
More informationOn 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 informationarxiv: 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 informationM-Polynomial and Degree-Based Topological Indices
M-Polynomial and Degree-Based Topological Indices Emeric Deutsch Polytechnic Institute of New York University, United States e-mail: emericdeutsch@msn.com Sandi Klavžar Faculty of Mathematics and Physics,
More informationOn Degree Sum Energy of a Graph
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 9, No. 3, 2016, 30-35 ISSN 1307-553 www.ejpam.com On Degree Sum Energy of a Graph Sunilkumar M. Hosamani 1,, Harishchandra S. Ramane 2 1 Department
More informationOn the higher randić indices of nanotubes
Journal of Computational Methods in Molecular Design, 205, 5 (3):0-5 Scholars Research Library (http://scholarsresearchlibrary.com/archive.html) On the higher randić indices of nanotubes Mohammad Reza
More informationRedefined 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 informationEQUIENERGETIC GRAPHS
5 Kragujevac J. Math. 26 (2004) 5 13. EQUIENERGETIC GRAPHS Harishchandra S. Ramane, 1 Hanumappa B. Walikar, 2 Siddani Bhaskara Rao, 3 B. Devadas Acharya, 4 Prabhakar R. Hampiholi, 1 Sudhir R. Jog, 1 Ivan
More informationSome results on the reciprocal sum-degree distance of graphs
J Comb Optim (015) 30:435 446 DOI 10.1007/s10878-013-9645-5 Some results on the reciprocal sum-degree distance of graphs Guifu Su Liming Xiong Xiaofeng Su Xianglian Chen Published online: 17 July 013 The
More informationEstimating 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 informationTHE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS
Hacettepe Journal of Mathematics and Statistics Volume 1 01 559 566 THE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS Hui Dong and Bo Zhou Received 01:09:011 : Accepted 15:11:011 e=uv EG Abstract The revised
More informationTWO TYPES OF CONNECTIVITY INDICES OF THE LINEAR PARALLELOGRAM BENZENOID
NEW FRONT. CHEM. (04) Former: Ann. West Univ. Timisoara Series Chem. Volume 3, Number, pp. 73-77 ISSN: 4-953 ISSN 393-7; ISSN-L 393-7 West University of Timișoara Article TWO TYPES OF CONNECTIVITY INDICES
More informationIt can be easily shown that the above definition is equivalent to
DOI 10.1186/s40064-016-1864-7 RESEARCH Open Access The F coindex of some graph operations Nilanjan De 1*, Sk. Md. Abu Nayeem 2 and Anita Pal 3 *Correspondence: de.nilanjan@rediffmail.com 1 Department of
More informationON THE GENERALIZED ZAGREB INDEX OF DENDRIMER NANOSTARS
NEW FRONT. CHEM. (2017) Former: Ann. West Univ. Timisoara Series Chem. Volume 26, Number 1, pp. 87-94 ISSN: 1224-9513 ISSN 2393-2171; ISSN-L 2393-2171 West University of Timișoara Research Article ON THE
More informationWiener 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 informationCO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH
An. Şt. Univ. Ovidius Constanţa Vol. 19(1), 011, 3 36 CO PRIME PATH DECOMPOSITION NUMBER OF A GRAPH K. NAGARAJAN and A. NAGARAJAN Abstract A decomposition of a graph G is a collection ψ of edge-disjoint
More informationVERTEX-WEIGHTED WIENER POLYNOMIALS OF SUBDIVISION-RELATED GRAPHS. Mahdieh Azari, Ali Iranmanesh, and Tomislav Došlić
Opuscula Math. 36, no. (06), 5 3 http://dx.doi.org/0.7494/opmath.06.36..5 Opuscula Mathematica VERTEX-WEIGHTED WIENER POLYNOMIALS OF SUBDIVISION-RELATED GRAPHS Mahdieh Azari, Ali Iranmanesh, and Tomislav
More informationNew 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 informationCounting 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 informationA Note on Revised Szeged Index of Graph Operations
Iranian J Math Che 9 (1) March (2018) 57 63 Iranian Journal of Matheatical Cheistry Journal hoepage: ijckashanuacir A Note on Revised Szeged Index of Graph Operations NASRIN DEHGARDI Departent of Matheatics
More informationLAPLACIAN 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 informationSolutions 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 informationSOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 38 07 8 9 8 SOME VERTEX-DEGREE-BASED TOPOLOGICAL INDICES UNDER EDGE CORONA PRODUCT I. Rezaee Abdolhosseinzadeh F. Rahbarnia M. Tavaoli Department of Applied
More informationRelation 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 informationOn Trees Having the Same Wiener Index as Their Quadratic Line Graph
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 76 (2016) 731-744 ISSN 0340-6253 On Trees Having the Same Wiener Index as Their Quadratic Line Graph Mohammad
More informationM-POLYNOMIALS AND DEGREE-BASED TOPOLOGICAL INDICES OF SOME FAMILIES OF CONVEX POLYTOPES
Open J. Math. Sci., Vol. 2(2018), No. 1, pp. 18-28 ISSN 2523-0212 Website: http://www.openmathscience.com M-POLYNOMIALS AND DEGREE-BASED TOPOLOGICAL INDICES OF SOME FAMILIES OF CONVEX POLYTOPES MUHAMMAD
More informationarxiv: v2 [math.co] 5 Nov 2015
Upper bounds for the achromatic and coloring numbers of a graph arxiv:1511.00537v2 [math.co] 5 Nov 2015 Baoyindureng Wu College of Mathematics and System Sciences, Xinjiang University Urumqi, Xinjiang
More informationOn Some Distance-Based Indices of Trees With a Given Matching Number
Applied Mathematical Sciences, Vol. 8, 204, no. 22, 6093-602 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.2988/ams.204.48656 On Some Distance-Based Indices of Trees With a Gien Matching Number Shu
More informationMathematical 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 informationEXACT FORMULAE OF GENERAL SUM-CONNECTIVITY INDEX FOR SOME GRAPH OPERATIONS. Shehnaz Akhter, Rashid Farooq and Shariefuddin Pirzada
MATEMATIČKI VESNIK MATEMATIQKI VESNIK 70, 3 2018, 267 282 September 2018 research paper originalni nauqni rad EXACT FORMULAE OF GENERAL SUM-CONNECTIVITY INDEX FOR SOME GRAP OPERATIONS Shehnaz Akhter, Rashid
More informationTHE STUDY OF HONEY COMB DERIVED NETWORK VIA TOPOLOGICAL INDICES
Open J. Math. Anal., Vol. (08), Issue, pp. 0-6 Website: https://pisrt.org/psr-press/journals/oma/ ISSN: 66-8 (online) 66-803 (Print) THE STUDY OF HONEY COMB DERIVED NETWORK VIA TOPOLOGICAL INDICES WEI
More informationCanadian Journal of Chemistry. On Topological Properties of Dominating David Derived Networks
Canadian Journal of Chemistry On Topological Properties of Dominating David Derived Networks Journal: Canadian Journal of Chemistry Manuscript ID cjc-015-015.r1 Manuscript Type: Article Date Submitted
More informationTHE GENERALIZED ZAGREB INDEX OF CAPRA-DESIGNED PLANAR BENZENOID SERIES Ca k (C 6 )
Open J Math Sci, Vol 1(2017), No 1, pp 44-51 ISSN 2523-0212 Website: http://wwwopenmathsciencecom THE GENERALIZED ZAGREB INDEX OF CAPRA-DESIGNED PLANAR BENZENOID SERIES Ca k (C 6 ) MUHAMMAD S SARDAR, SOHAIL
More informationPAijpam.eu SOME NEW/OLD DEGREE-BASED TOPOLOGICAL INDICES OF NANOSTAR DENDRIMERS
International Journal of Pure and Applied Mathematics Volume 117 No. 1 2017, 173-183 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v117i1.14
More informationComplexity of the Szeged Index, Edge Orbits, and Some Nanotubical Fullerenes
Complexity of the Szeged Index, Edge Orbits, and Some Nanotubical Fullerenes Yaser Alizadeh Department of Mathematics, Hakim Sabzevari University, Sabzevar, Iran e-mail: y.alizadeh@hsu.ac.ir Sandi Klavžar
More informationThe 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 informationarxiv: v1 [cs.dm] 31 Mar 2013
The Total Irregularity of Graphs under Graph Operations arxiv:13040185v1 [csdm] 31 Mar 2013 April 2, 2013 Hosam Abdo, Darko Dimitrov Institut für Informatik, Freie Universität Berlin, Takustraße 9, D 14195
More informationarxiv: 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 informationON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS
Kragujevac J. Sci. 29 2007) 73 84. UDC 541.66:547.318 ON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS Hanumappa B. Walikar, a Harishchandra S. Ramane, b Ivan Gutman, c Sabeena B. Halkarni a a Department of
More informationVertex-Weighted Wiener Polynomials for Composite Graphs
Also available at http://amc.imfm.si ARS MATHEMATICA CONTEMPORANEA 1 (008) 66 80 Vertex-Weighted Wiener Polynomials for Composite Graphs Tomislav Došlić Faculty of Civil Engineering, University of Zagreb,
More informationAbout Atom Bond Connectivity and Geometric-Arithmetic Indices of Special Chemical Molecular and Nanotubes
Journal of Informatics and Mathematical Sciences Vol. 10, Nos. 1 & 2, pp. 153 160, 2018 ISSN 0975-5748 (online); 0974-875X (print) Published by RGN Publications http://dx.doi.org/10.26713/jims.v10i1-2.545
More informationD-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 informationTHE 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 informationarxiv: v1 [math.co] 30 Dec 2015
Resolvent Energy of Unicyclic, Bicyclic and Tricyclic Graphs arxiv:1512.08938v1 [math.co] 30 Dec 2015 Luiz Emilio Allem 1, Juliane Capaverde 1, Vilmar Trevisan 1, Abstract Ivan Gutman 2,3, Emir Zogić 3,
More informationAnalogies 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