MULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
|
|
- Chastity Rodgers
- 5 years ago
- Views:
Transcription
1 Transactions on Combinatorics ISSN (print): , ISSN (on-line): Vol. 3 No. 2 (2014), pp c 2014 University of Isfahan MULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS Z. LUO AND J. WU Communicated by Ali Reza Ashrafi Abstract. Let G be a connected graph. The multiplicative Zagreb eccentricity indices of G are defined respectively as 1(G) v V (G) ε2 G(v) and 2(G) uv E(G) εg(u)εg(v), where εg(v) is the eccentricity of vertex v in graph G and ε 2 G(v) (ε G(v)) 2. In this paper, we present some bounds of the multiplicative Zagreb eccentricity indices of Cartesian product graphs by means of some invariants of the factors and supply some exact expressions of 1 and 2 indices of some composite graphs, such as the join, disjunction, symmetric difference and composition of graphs, respectively. 1. Introduction Throughout this paper we consider only undirected simple connected graphs. For terminology and notations are not defined here we refer the reader to West [10]. Let G (V (G), E(G)) be a graph with the vertex set V (G) and the edge set E(G), the number of vertices and edges of G will be denoted by V (G) (or G ) and E(G), respectively. We denote the degree and the neighborhood of a vertex v of G by deg G (v) and N G (v), then deg G (v) N G (v). As usual the distance between vertices u and v of graph G, denoted by d G (u, v), is defined as the number of edges in a shortest path connecting the vertices u and v. For a vertex v of V (G), its eccentricity ε G (v) is the largest distance between v and any other vertex u of G, i.e., ε G (v) max u V (G) d G (u, v). A vertex v V (G) is well-connected if ε G (v) 1, i.e., if it is adjacent to all other vertices of G. We suppose that W denotes the set of all well-connected vertices of G and W i is the set of all well-connected vertices of G i (i 1, 2,..., n), respectively. MSC(2010): Primary: 05C12; Secondary: 05C76. Keywords: Multiplicative Zagreb eccentricity indices; composite operations; Cartesian product. Received: 18 October. 2013, Accepted: 5 April Corresponding author. 21
2 22 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu A topological index is a real number related to a (molecular) graph, it does not rely on the labeling or the pictorial representation of a graph. There are several topological indices be defined in the chemical literatures, especially those vertex-degree-based and vertices-distance-based topological indices, which have been found many applications as means for modeling chemical, pharmaceutical and other properties of molecules. One of the oldest and extensively studied vertex-degree-based topological indices are the first and second Zagreb indices M 1 and M 2, introduced by Gutman and Trinajstić [5], which are applied to study molecular, chirality in quantitative structure-activity relationship (QSAR) and quantitative structureproperty relationship (QSPR) analysis, etc. They are defined as M 1 (G) v V (G) (deg G(v)) 2 and M 2 (G) uv E(G) deg G(u)deg G (v). The multiplicative variant of Zagreb indices was introduced by Todeschini et. al. [8], they are defined as 1 (G) v V (G) (deg G(v)) 2 and 2 (G) uv E(G) deg G(u)deg G (v). Gutman in [6] call these indices as multiplicative Zagreb indices. Recently, the topological indices based on vertex eccentricities attracted some attention in Chemistry. In analogy with the ordinary Zagreb indices, the first and second Zagreb eccentricity indices M1 and M 2 of a connected graph G have been introduced by Ghorbani et al. [4] and Vukičević et al. [9] as the revised version of the Zagreb indices. They are defined as M1 (G) v V (G) (ε G(v)) 2 and M 2 (G) uv E(G) ε G(u)ε G (v). Ghorbani and Hosseinzadeh computed the Zagreb eccentricity indices of some composite graphs. Vuki cević and Graovac showed that M 1 (G)/ G M 2 (G)/ E(G) holds for all acyclic and unicyclic graphs and that neither this nor the opposite inequality holds for all bicyclic graphs. For further results of the Zagreb eccentricity indices, we encourage the reader refer to [1, 3, 11]. In analogy with the first and second multiplicative Zagreb indices, the multiplicative Zagreb eccentricity indices of the connected graph G were introduced by De [2] and are defined respectively as 1(G) 2(G) v V (G) uv E(G) ε 2 G(v) v V (G) ε G (u)ε G (v). (ε G (v)) 2, In this paper, we present some bounds of the multiplicative Zagreb eccentricity indices of Cartesian product graphs by means of some invariants of the factors, and supply some exact expressions of 1 and 2 indices of some composite graphs, such as the join, disjunction, symmetric difference and composition of graphs, respectively. 2. Some bounds of 1 and 2 indices of Cartesian product graphs The Cartesian product G 1 G 2 of graphs G 1 and G 2 has the vertex set V (G 1 G 2 ) V (G 1 ) V (G 2 ) and (u 1, u 2 )(v 1, v 2 ) is an edge of G 1 G 2 if and only if u 1 v 1 and u 2 v 2 E(G 2 ) or u 2 v 2 and u 1 v 1 E(G 1 ). If G 1, G 2,..., G n are n( 2) graphs, then we denote G 1 G 2 G n by n G i.
3 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu 23 Lemma 2.1. [4] Let G 1, G 2,..., G n be n graphs. Then deg n G i ((u 1, u 2,..., u n )) ε n G i ((u 1, u 2,..., u n )) deg Gi (u i ), ε Gi (u i ). Theorem 2.2. Let G 1, G 2,..., G n be n nontrivial graphs. Then 1( n G i ) n 2 n n Gi ( 1 (G i ) ) 1 n n j1,j i G j with equality if and only if ε G1 (u 1 ) ε G2 (u 2 ) ε Gn (u n ) for any vertex (u 1, u 2,..., u n ) in n G i. Proof. By Arithmetic-Geometric Mean Inequality, we have ε Gi (u i ) n n n ε Gi (u i ) n ( n (2.1) ε Gi (u i ) ) 1 n. So, from Lemma 2.1 and the inequality (2.1), we can obtain that 1( n G i ) ε 2 n G ((u i 1, u 2,..., u n )) The proof is completed. (u 1,u 2,...,u n) V ( n G i) (u 1,u 2,...,u n) V ( n G i) (u 1,u 2,...,u n) V ( n G i) n 2 n G i ( n ε Gi (u i ) ) 2 n 2 n n ε 2 G i (u i ) n ( 1 (G i ) ) 1 n n j1,j i G j. Theorem 2.3. Let G i (i 1, 2,..., n) does not contain any well-connected vertex. Then n 1( n ( G i ) 1 (G i ) ) n j1,j i G j (2.2) with equality if and only if ε G1 (u 1 ) ε G2 (u 2 ) ε Gn (u n ) for any vertex (u 1, u 2,..., u n ) of n G i. Proof. Note that G i (i 1, 2,..., n) does not contain any well-connected vertex, then for any vertex u i of G i, we have ε Gi (u i ) > 1, i 1, 2,..., n. So, we can obtain that n ε G i (u i ) n ε G i (u i ). By Lemma 2.1 and the same discussing method in Theorem 2.2, it is easy to deduce the inequality (2.2) holds. Similarly, we can also obtain the lower and upper bounds of 2 index of Cartesian product graphs.
4 24 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu Theorem 2.4. Let G 1, G 2,..., G n be n nontrivial graphs. Then 2( n G i ) n 2 n E(G i) ( n j1,j i G j ) n [ n ( 1 (G j ) ) E(G i ) n k1,k i,j G ( k 2 (G i ) ) ] n j1,j i G j 1 n j1,j i with equality if and only if ε G1 (u 1 ) ε G2 (u 2 ) ε Gn (u n ) for any vertex (u 1, u 2,..., u n ) in n G i. If n 2, set n k1,k i,j G k 1. Theorem 2.5. Let G i (i 1, 2,..., n) does not contain any well-connected vertex. Then n [ n 2( n ( G i ) 1 (G j ) ) E(G i ) n k1,k i,j G ( k 2 (G i ) ) ] n j1,j i G j j1,j i with equality if and only if ε G1 (u 1 ) ε G2 (u 2 ) ε Gn (u n ) for any vertex (u 1, u 2,..., u n ) of n G i. If n 2, set n k1,k i,j G k and 2 indices of join graphs The join G 1 +G 2 of two graphs G 1 and G 2 with disjoint vertex sets V (G 1 ) and V (G 2 ) and edge sets E(G 1 ) and E(G 2 ) is the graph union G 1 G 2 together with all the edges joining V (G 1 ) and V (G 2 ). The definition generalizes to the case of n 3 graphs in a straightforward manner. In order to finish calculations of the first and second multiplicative Zagreb eccentricity indices of join of graphs, we first present two key Lemmas as bellow. Lemma 3.1. [4, 7] Let G 1, G 2,..., G n be n graphs. Then E(G 1 + G G n ) [ E(G i ) + deg G1 +G 2 + +G n (v) deg Gi (v) + j1,i<j j1,j i G j. G i G j ], Lemma 3.2. For any vertex v V (G i )(1 i n) n V (G i) V (G 1 + G G n ), we have 1, if v W i ; ε G1 +G 2 + +G n (v) 2, if v V (G i ) \ W i. Theorem 3.3. Let G G 1 + G G n. 0 W i G i, i 1, 2,..., n. Then 1(G) 4 n ( G i W i ), 2(G) 2 n [2 E(G i) W i ( G i 1)+( G i W i ) n j1,j i G j ]. Proof. By the definition of 1 index, Lemmas 3.1 and 3.2, we have 1(G) ε 2 G(v) V (G)\ n Wi 4 n ( G i W i ). v V (G) v n W i v V (G)\ n W i
5 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu 25 2(G) uv E(G) n [1 2 n ε G (u)ε G (v) v W i deg G (v) 2 v V (G i )\W i deg G (v) v V (G) (ε G (v)) deg G (v) v V (G i )\W deg (v) i G ] n v V (G 2 i )\W [deg i Gi (v)+ n j1,j i G j ] n [ v V (G i )\W deg i Gi (v)+ n v V (G i )\W i j1,j i G j ] 2 2 n [2 E(G i) W i ( G i 1)+( G i W i ) n j1,j i G j ]. This completes the proof. Corollary 3.4. Let ng G } + {{ + G } and the set of well-connected vertices of G is W. Then n times 1(nG) 4 n( G W ), 2(nG) 2 [2n E(G) +2(n 2) G 2 +n W n 2 G W )]. Corollary 3.5. If none of G i, i 1, 2,..., n contains well-connected vertices, then 1(G 1 + G G n ) 4 n G i, 2(G 1 + G G n ) 4 n [ E(G i) + n j1,i<j G i G j ] and 2 indices of disjunction and symmetric difference of two graphs The disjunction G 1 G 2 of two graphs G 1 and G 2 is the graph with vertex set V (G 1 ) V (G 2 ) and edge set E(G 1 G 2 ) {(u 1, u 2 )(v 1, v 2 ) u 1 v 1 E(G 1 ) or u 2 v 2 E(G 2 )}. Lemma 4.1. [4, 7] Let G 1 and G 2 be two graphs, then E(G 1 G 2 ) E(G 1 ) G E(G 2 ) G E(G 1 ) E(G 2 ), deg G1 G 2 ((u, v)) G 2 deg G1 (u) + G 1 deg G2 (v) deg G1 (u)deg G2 (v). The following lemma is obvious by means of the definition of disjunction of two graphs. Lemma 4.2. Let G 1 and G 2 be two graphs, W i is the set of well-connected vertices of G i and 0 W i V (G i ), i 1, 2. Then 1, if u W 1 and v W 2 ; ε G1 G 2 ((u, v)) 2, otherwise. Theorem 4.3. Let G 1 and G 2 be two graphs. Then 1(G 1 G 2 ) 4 ( G 1 G 2 W 1 W 2 ), 2(G 1 G 2 ) 2 [2( E(G 1) G E(G 2 ) G E(G 1 ) E(G 2 ) ) W 2 G 2 s(w 1 ) W 1 G 1 s(w 2 )+s(w 1 )s(w 2 )],
6 26 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu where s(w i ) v W i deg Gi (v), i 1, 2. Proof. From the definitions of multiplicative Zagreb eccentricity indices 1, 2 and Lemmas 4.1 and 4.2, we have 1(G 1 G 2 ) 2(G 1 G 2 ) (u,v) V (G 1 G 2 ) ε 2 G 1 G 2 ((u, v)) 4 V (G 1 G 2 )\(W 1 W 2 ) 4 ( G 1 G 2 W 1 W 2 ), 2 (u,v) V (G 1 G 2 ) (u,v) V (G 1 G 2 )\(W 1 W 2 ) (ε G1 G 2 ((u, v))) deg G 1 G 2 ((u,v)) 2 deg G 1 G 2 ((u,v)) (u,v) V (G 1 G 2 )\(W 1 W 2 ) (u,v) V (G 1 G 2 )\(W 1 W 2 ) deg G 1 G 2 ((u,v)) 2 [ (u,v) V (G 1 G 2 ) deg G 1 G 2 ((u,v)) (u,v) W 1 W 2 deg G1 G 2 ((u,v))] 2 [2 E(G 1 G 2 ) u W 1 v W 2 ( G 2 deg G1 (u)+ G 1 deg G2 (v) deg G1 (u)deg G2 (v))] 2 [2( E(G 1) G E(G 2 ) G E(G 1 ) E(G 2 ) ) W 2 G 2 s(w 1 ) W 1 G 1 s(w 2 )+s(w 1 )s(w 2 )]. 2 2 The proof is completed. Corollary 4.4. If G 1 or G 2 does not contain any well-connected vertex, then 1(G 1 G 2 ) 4 G 1 G 2, 2(G 1 G 2 ) 4 [ E(G 1 ) G E(G 2 ) G E(G 1 ) E(G 2 ) ]. The symmetric difference G 1 G 2 of two graphs G 1 and G 2 is the graph with vertex set V (G 1 ) V (G 2 ) and edge set {(u 1, u 2 )(v 1, v 2 ) u 1 v 1 E(G 1 ) or u 2 v 2 E(G 2 ) but not both}. Lemma 4.5. [4] Let G 1 and G 2 be two graphs, then E(G 1 G 2 ) E(G 1 ) G E(G 2 ) G E(G 1 ) E(G 2 ), deg G1 G 2 ((u, v)) G 2 deg G1 (u) + G 1 deg G2 (v) 2deg G1 (u)deg G2 (v). For any vertex (u, v) V (G 1 G 2 ), by the definition of symmetric difference of two graphs, we have ε G1 G 2 ((u, v)) 2. So, by Lemma 4.5, it is easy to obtain the following theorem. Theorem 4.6. Let G 1 and G 2 be two graphs. Then 1(G 1 G 2 ) 4 G 1 G 2, 2(G 1 G 2 ) 4 [ E(G 1 ) G E(G 2 ) G E(G 1 ) E(G 2 ) ].
7 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu and 2 indices of composition of two graphs The composition G 1 [G 2 ] of graphs G 1 and G 2 with disjoint vertex sets V (G 1 ) and V (G 2 ), edge sets E(G 1 ) and E(G 2 ) is the graph with vertex set V (G 1 [G 2 ]) V (G 1 ) V (G 2 ) and edge set E(G 1 [G 2 ]) {(u 1, v 1 )(u 2, v 2 ) u 1 u 2 E(G 1 ) or (u 1 u 2 and v 1 v 2 E(G 2 ))}. By means of the definition as above, it is easy to deduce the following lemma. Lemma 5.1. Let W i be the set of well-connected vertices in graph G i, i 1, 2. Then we have 1, if u W 1 and v W 2 ; ε G1 [G 2 ]((u, v)) 2, if u W 1 and v V (G 2 ) \ W 2 ; ε G1 (u), otherwise. Lemma 5.2. [4, 7] Let G 1 and G 2 be two graphs, then E(G 1 [G 2 ]) E(G 1 ) G E(G 2 ) G 1, deg G1 [G 2 ]((u, v)) G 2 deg G1 (u) + deg G2 (v). Theorem 5.3. Let G 1 and G 2 be two graphs and W i be the set of well-connected vertices in G i, i 1, 2. Then 1(G 1 [G 2 ]) 4 W 1 ( G 2 W 2 ) ( 1(G 1 ) ) G 2, 2(G 1 [G 2 ]) 2 W 1 [ G 2 ( G 2 W 2 )( G 1 1)+2 E(G 2 ) W 2 ( G 2 1)] ( 1(G 1 ) ) E(G 2 ) ( 2 (G 1 ) ) G 2 2. Proof. By the definitions of 1 index and 2 index, Lemmas 5.1 and 5.2, we arrive at 1(G 1 [G 2 ]) ε 2 G 1 [G 2 ]((u, v)) (u,v) V (G 1 [G 2 ] u W 1,v W 2 u W 1,v V (G 2 )\W 2 4 W 1 ( G 2 W 2 ) ( ε 2 G 1 (u) u V (G 1 )\W 1 4 W 1 ( G 2 W 2 ) ( 1(G 1 ) ) G 2. u V (G 1 )\W 1,v V (G 2 ) ) G2 ε 2 G 1 (u) 2(G 1 [G 2 ]) (ε G1 [G 2 ]((u, v))) deg G 1 [G 2 ] ((u,v)) (u,v) V (G 1 [G 2 ]) 2 [ G2 degg1 (u)+deg G2 (v)] u W 1,v V (G 2 )\W 2 ( εg1 (u) ) [ G 2 deg G1 (u)+deg G2 (v)] u V (G 1 )\W 1,v V (G 2 )
8 28 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu 2 u W 1,v V (G 2 )\W [ G 2 deg 2 G1 (u)+deg (v)] G2 u V (G 1 )\W 1,v V (G 2 ) ( εg1 (u) ) deg G2 (v) u V (G 1 )\W 1,v V (G 2 ) 2 [ G 2 ( G 2 W 2 ) u W deg 1 G1 (u)+ W 1 v V (G 2 )\W deg 2 G2 (v)] ( (ε G1 (u)) degg1 (u) ) G 2 2 ( ε 2 G 1 (u) u V (G 1 )\W 1 u V (G 1 )\W 1 ( εg1 (u) ) G 2 deg G1 (u) ) 1 2 v V (G 2 ) deg G 2 (v) 2 W 1 [ G 2 ( G 2 W 2 )( G 1 1)+2 E(G 2 ) W 2 ( G 2 1)] ( 2(G 1 ) ) G 2 2 ( 1(G 1 ) ) E(G 2 ). This completes the proof. Corollary 5.4. If W 1 or W 2 V (G 2 ), i.e., G 1 does not contain any well-connected vertex or G 2 is a complete graph. Then 1(G 1 [G 2 ]) ( 1(G 1 ) ) G 2 and 2 (G 1 [G 2 ]) ( 1(G 1 ) ) E(G 2 ) ( 2 (G 1 ) ) G 2 2. Acknowledgments The authors wish to thank the referee for helpful comments and suggestions. This work is supported by the National Natural Science Foundation of China (No ), the Scientific Research Programs of the Higher Education Institution of Xinjiang (XJEDU2012I37, XJEDU2012I38) and the Science Foundation of Changji University (2012YJYB003). References [1] K. C. Das, D. W. Lee and A. Graovac, Some properties of the Zagreb eccentricity indices, Ars Math. Contemp., 6 (2013) [2] N. De, On multiplicative Zagreb eccenticity indices, South Asian J. Math., 2 no. 6 (2012) [3] Z. Du, B. Zhou and N. Trinajstić, Extremal properties of the Zagreb eccentricity indices, Croat. Chem. Acta, 85 no. 3 (2012) [4] M. Ghorbani and M. A. Hosseinzadeh, A new version of Zagreb indices, Filomat, 26 (2012) [5] I. Gutman and N. Trinajstić, Graph theory and molecular orbitals, Total π electron energy of alternant hydrocarbons, Chem. Phys. Lett. 17 (1972) [6] I. Gutman, Multipicative Zagreb indices of trees, Bull. Internat. Math. Virt. Inst., 1 (2011) [7] M. H. Khalifeh, H. Yousefi-Azari and A. R. Ashrafi, The first and second Zagreb indices of some graph operations, Discrete Appl. Math., 157 (2009) [8] R. Todeschini and V. Consonni, New local vertex invariants and molecular descriptors based on functions of the vertex degree, MATCH Commun. Math. Comput. Chem., 64 (2010) [9] D. Vuki cević and A. Graovac, Note on the comparison of the first and second normalized Zagreb eccentricity indices, Acta Chim. Slov. 57 (2010) [10] D. B. West, Introduction to Graph Theory, second ed., Prentice Hall, Inc., Upper Saddle River, NJ, [11] R. Xing, B. Zhou and N. Trinajstić, On Zagreb eccentricity indices, Croat. Chem. Acta, 84 no. 4 (2011)
9 Trans. Comb. 3 no. 2 (2014) Z. Luo and J. Wu 29 Zhaoyang Luo Department of Mathematics, Changji University, Changji , China School of Mathematics, Shandong University, Jinan , China sdmlzy@163.com Jianliang Wu School of Mathematics, Shandong University, Jinan , China jlwu@sdu.edu.cn
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 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 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 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 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 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 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 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 informationA 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 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 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 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 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 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 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 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 informationNOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 1 (2015), pp. 57-61. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir NOTE ON THE SKEW ENERGY OF
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 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 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 informationGLOBAL 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 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 informationTransactions 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(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 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 informationThe sharp bounds on general sum-connectivity index of four operations on graphs
Akhter and Imran Journal of Inequalities and Applications (206) 206:24 DOI 0.86/s3660-06-86-x R E S E A R C H Open Access The sharp bounds on general sum-connectivity index of four operations on graphs
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 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 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 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 informationPredicting 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 informationEstimating 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 informationTopological 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 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 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 informationTHE (a,b)-zagreb INDEX OF NANOSTAR DENDRIMERS
U.P.B. Sci. Bull., Series B, Vol. 80, Iss. 4, 2018 ISSN 1454-2331 THE (a,b)-zagreb INDEX OF NANOSTAR DENDRIMERS Prosanta SARKAR 1, Nilanjan DE 2, Anita PAL 3 In chemical graph theory, the structure of
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 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 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 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 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 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 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 informationPredicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-degree. Süleyman Ediz 1
Predicting Some Physicochemical Properties of Octane Isomers: A Topological Approach Using ev-degree and ve-degree Zagreb Indices Süleyman Ediz 1 Received: 30 November 2016 Abstract Topological indices
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 informationSKEW-SPECTRA AND SKEW ENERGY OF VARIOUS PRODUCTS OF GRAPHS. Communicated by Ivan Gutman
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol. 4 No. 2 (2015, pp. 13-21. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir SKEW-SPECTRA AND SKEW ENERGY
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 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 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 informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
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 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 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 informationSEMI-STRONG SPLIT DOMINATION IN GRAPHS. Communicated by Mehdi Alaeiyan. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 51-63. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SEMI-STRONG SPLIT DOMINATION
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 informationCanadian Journal of Chemistry. On Molecular Topological Properties of Dendrimers
On Molecular Topological Properties of Dendrimers Journal: Manuscript ID cjc-01-04.r1 Manuscript Type: Article Date Submitted by the Author: 04-ov-01 Complete List of Authors: Bokhary, Syed Ahtsham Ul
More informationSome Topological Indices of L(S(CNC k [n]))
Punjab University Journal of Mathematics ISSN 1016-226 Vol. 4912017 pp. 13-17 Some Topological Indices of LSCNC k [n] M. Faisal Nadeem CIIT Lahore, Pakistan Email: mfaisalnadeem@ymail.com Sohail Zafar
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 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 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 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 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 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 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 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 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 informationThe Normalized Laplacian Estrada Index of a Graph
Filomat 28:2 (204), 365 37 DOI 0.2298/FIL402365L Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat The Normalized Laplacian Estrada
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 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 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 informationCOMPUTING SANSKRUTI INDEX OF DENDRIMER NANOSTARS. Chengdu University Chengdu, , P.R. CHINA 2 Department of Mathematics
International Journal of Pure and Applied Mathematics Volume 115 No. 2 2017, 399-404 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v115i2.16
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 informationSOME DESIGNS AND CODES FROM L 2 (q) Communicated by Alireza Abdollahi
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 1 (2014), pp. 15-28. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir SOME DESIGNS AND CODES FROM
More informationExtremal 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 informationON SOME DEGREE BASED TOPOLOGICAL INDICES OF T io 2 NANOTUBES
U.P.B. Sci. Bull., Series B, Vol. 78, Iss. 4, 2016 ISSN 1454-2331 ON SOME DEGREE BASED TOPOLOGICAL INDICES OF T io 2 NANOTUBES Abdul Qudair Baig 1 and Mehar Ali Malik 2 Two well known connectivity topological
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 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 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 informationImproved 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 informationCommunicated 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 informationThe Eccentric Connectivity Index of Dendrimers
Int. J. Contemp. Math. Sciences, Vol. 5, 2010, no. 45, 2231-2236 The Eccentric Connectivity Index of Dendrimers Jianguang Yang and Fangli Xia Department of Mathematics, Hunan City University Yiyang, Hunan
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 [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 informationOn the Average of the Eccentricities of a Graph
Filomat 32:4 (2018), 1395 1401 https://doi.org/10.2298/fil1804395d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Average
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 informationJOURNAL OF MATHEMATICAL NANOSCIENCE. Connective eccentric index of fullerenes
JOURNAL OF MATHEMATICAL NANOSCIENCE JMNS Vol 1, No 1, 2011, 43-50 Connective eccentric index of fullerenes MODJTABA GHORBANI Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training
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 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 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 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 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 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 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 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 informationORDERING CATACONDENSED HEXAGONAL SYSTEMS WITH RESPECT TO VDB TOPOLOGICAL INDICES
REVISTA DE MATEMÁTICA: TEORÍA Y APLICACIONES 2016 23(1) : 277 289 CIMPA UCR ISSN: 1409-2433 (PRINT), 2215-3373 (ONLINE) ORDERING CATACONDENSED HEXAGONAL SYSTEMS WITH RESPECT TO VDB TOPOLOGICAL INDICES
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 Graovac-Pisanski index of a connected bipartite graph is an integer number
arxiv:1709.04189v1 [math.co] 13 Sep 017 The Graovac-Pisanski index of a connected bipartite graph is an integer number Matevž Črepnjak a,b,c, Martin Knor d, Niko Tratnik a, Petra Žigert Pleteršek a,b a
More informationON 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 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 information