Discrete Applied Mathematics
|
|
- Elinor Merritt
- 5 years ago
- Views:
Transcription
1 iscrete Applied Mathematics Contents lists available at Scienceirect iscrete Applied Mathematics journal homepage: On reciprocal complementary Wiener number Bo Zhou a,, Xiaochun Cai a, Nenad Trinajstić b a epartment of Mathematics, South China Normal University, Guangzhou 5063, China b The Rugjer Bošković Institute, P. O. Box 80, HR-0 00 Zagreb, Croatia a r t i c l e i n f o a b s t r a c t Article history: Received 3 March 008 Received in revised form 30 June 008 Accepted 8 September 008 Available online 9 October 008 We report properties, especially upper and lower bounds and the Nordhaus Gaddum-type result for the reciprocal complementary Wiener number of a connected molecular graph. 008 Elsevier B.V. All rights reserved. Keywords: Connected graphs Reciprocal complementary Wiener number Upper and lower bounds Nordhaus Gaddum-type result. Introduction The Wiener number []a often also called the Wiener index [] and the related molecular descriptors have a long history [8,5,7,3] since 97 when Harry Wiener [9] introduced his number as the path number []. The empirical Wiener s definition of his number has been formalized via the distance matrix []a by Hosoya [6]. In the large family of the Wiener-like molecular descriptors [0], the complementary Wiener number and the reciprocal complementary Wiener number are recent additions. They have been introduced by Ivanciuc [7] and discussed by Ivanciuc et al. [8,9]. Related work may be found in, e.g., [0]. We consider simple molecular graphs, i.e., graphs without multiple edges and loops []b, [3]a. Let G be a connected graph with the vertex-set VG = {v, v,..., v n }. The distance matrix of G is an n n matrix d ij such that d ij is just the distance i.e., the number of edges of a shortest path between the vertices v i and v j in G []a, denoted by dv i, v j G. The complementary distance matrix C of G is an n n matrix c ij such that c ij = d ij if i j, and 0 otherwise []b, where is the diameter of the graph G [3]b. The reciprocal complementary distance matrix RC of G is an n n matrix rc ij such that rc ij = if i c ij j, and 0 otherwise []c. The Hosoya definition of the Wiener number of G, denoted by WG, is given by [6] WG = n n d ij = d ij. i<j i= j= The reciprocal complementary Wiener RCW number of the graph G is similarly defined as [7] RCWG = n n rc ij = rc ij. i<j i= j= Corresponding author. addresses: zhoubo@scnu.edu.cn B. Zhou, trina@irb.hr N. Trinajstić X/$ see front matter 008 Elsevier B.V. All rights reserved. doi:0.06/j.dam
2 B. Zhou et al. / iscrete Applied Mathematics The RCW number has been successfully applied in the structure-property modeling of the molar hear capacity, standard Gibbs energy of formation and vaporization enthalpy of 3 alkanes C 6 C 0 [7]. In the present report, we give some properties, especially various upper and lower bounds and the Nordhaus Gaddumtype result [] of the reciprocal complementary Wiener number.. Bounds for the reciprocal complementary Wiener number Let P n and S n be respectively the path and the star with n vertices. Let K n be the complete graph with n vertices. Let dg, k be the number of the unordered pairs of vertices of G that are at distance k, k =,,...,. Then RCWG = k= dg, k k. We first give upper bounds for RCW number using the graph-parameters such as the number of vertices and the number of edges. Proposition. Let G be a connected graph with n vertices. Then nn RCWG with equality if and only if G = K n. Proof. For i, j =,,..., n with i j, it is easily seen that rc ij = d ij with equality if and only if = d ij =. Thus RCWG nn with equality if and only if =, i.e., G = K n. Proposition. Let G be a noncomplete connected graph with n 3 vertices and m edges. Then nn RCWG m with equality if and only G has diameter. Proof. Note that dg, = nn m and k= dg, k = m. Since G K n, we have, and then RCWG = k= m dg, k k nn with equality if and only if =. dg, dg, k k= nn m = m Let G be a connected graph with n vertices, m edges and diameter. Then by the above argument, nn m RCWG with equality if and only if =. Corollary 3. Let G be a noncomplete connected graph with n 3 vertices. Then n RCWG with equality if and only G = S n. Proof. Let m be the number of G. Then m n with equality if and only if G is a tree. Now the result follows from Proposition. By Corollary 3, if G is a tree with n 3 vertices, then RCWG n with equality if and only if G = S n. Similarly to the argument in Corollary 3, if G is a unicyclic graph with n vertices then RCWG nn with equality if and only if G is the quadrangle, or the pentagon, or the graph formed by attaching n 3 pendant vertices to a vertex of a triangle. For v i VG, Γ v i denotes the set of its first neighbors in G and the degree of v i is δ i = Γ v n i. The term i= δ i is known as the first Zagreb index of G, denoted by M G [,,3,6].
3 630 B. Zhou et al. / iscrete Applied Mathematics Proposition. Let G be a triangle- and quadrangle-free connected graph with n vertices and m edges. If the diameter of G is at least three, then nn RCWG m 6 M G with equality if and only if G has diameter 3. Proof. Note that there are dg, = m. Since G is triangle- and quadrangle-free, we have dg, = M G m see [6], nn and then k=3 dg, k = M G. Then dg, k dg, dg, RCWG dg, k k k= k=3 m 3 [ ] M nn G m M G nn = m 6 M G with equality if and only if = 3. Now we give lower bounds for RCW number. For a graph G, G stands for its complement []c. A graph is said to be diameter-maximal if the diameter of Ge the graph formed from G by adding the edge e is smaller than that of G for every edge e of G. Lemma 5 [5]. A graph G of diameter is diameter-maximal if and only if there is a vertex v, such that the distance layers V i, where V i = {x dv, x G = i} for i = 0,,...,, fulfill the condition that the subgraph induced by V i V i is complete for any i =,,...,, and if then V =. By similar argument as in [6], we have Proposition 6. Let G be a connected graph with n vertices and diameter. Then RCWG f n, with equality if and only if G is a diameter-maximal graph for which all noncentral layers are trivial, where n n n for even, i f n, = n n n for odd. i Proof. Let G be a graph with minimum RCW number in the class of graphs with n vertices and diameter. Evidently, G is a diameter-maximal graph, and thus it has the form given in Lemma 5. Suppose that there is a noncentral layer V k with V k > and x V k. If k <, then we choose the least such k, and for a new diameter-maximal graph G with layers V 0, V,..., V k, V k {x}, V k {x}, V k,..., V, it is easily seen that RCWG RCWG = k i= i i = k k V ik i= k k = k i= k k i= V ik i i i i = k k < 0, i i
4 B. Zhou et al. / iscrete Applied Mathematics from which we have RCWG < RCWG, a contradiction. If k >, then we choose the maximal such k,and for a new diameter-maximal graph G with layers V 0, V,..., V k, V k {x}, V k {x}, V k,..., V, it is easily seen that k RCWG RCWG = i k V k i i i i i= i= = k k V k i i i i= k k i i i= = k = k k k < 0, a contradiction again. Now we have proved that for G, all noncentral layers are trivial. It may be checked that RCWG = f n,. Proposition 7. Let G be a connected graph with n vertices. Then RCWG n with equality if and only if G = P n. Proof. Let be the diameter of G. Suppose that < n. If is even, then f n, f n, = n i n If is odd, then n n i = n i n n n f n, f n, = n n n n n n [ ] n = n n > 0. n = n n i i n n i n n n n n > 0. Thus, f n, is decreasing for n. Now the result follows from Lemma 6. Let G be a tree with n 3 vertices. By Proposition 7, RCWG n with equality if and only if G = P n. A direct reasoning is as follows. Let w 0 w... w be a diametrical path in G. Suppose that < n. Then for some k =,,...,, w k
5 63 B. Zhou et al. / iscrete Applied Mathematics has a neighbor w outside this path. Let G be the tree formed from G by deleting the edge w k w k and adding the edge ww k. Obviously, G has diameter. Let V and V be respectively the set of vertices of the subtree of G containing vertex w k and w k formed by deleting the edge w k w k. Let d = dv ij i, v j G and let rc ij be the i, j-entry of the reciprocal complementary matrix of G. For v i, v j V or v i, v j V with i j, we have d ij = d ij and then rc ij < rc ij. For v i V and v j V, we have d ij = d ij or d ij = d ij and then rc ij = rc ij or rc ij < rc ij. Thus, RCWG < RCWG. Using this transformation, we can finally obtain RCWG > RCWP n = n if G P n. By combining Corollary 3, we know that RCW number satisfies the basic requirement to be a branching index []. 3. Nordhaus Gaddum-type result for the reciprocal complementary Wiener number Zhang and Wu [] and Zhou, Cai and Trinajstić [5] obtained the Nordhaus Gaddum-type result for the Wiener index, Zagreb indices, connectivity index and the Harary index, respectively. In the following, we give the Nordhaus Gaddumtype result for RCW number. There is only one connected graph P on vertices with the connected complement P = P. Obviously, RCWP RCWP = RCWP = 6. For n 5, the diameter of P n is. Lemma 8. Let G be a connected graph on n 5 vertices. If G has diameter, then RCWG RCWG n 5n 6 with equality if and only if G = P n. Proof. By Proposition, RCWG n with equality if and only if G = P n. Let [ m be the number ] of edges in G. Then m nn n. By Proposition, RCWG = nn m nn nn n = nn n with equality if and only if the number of edges of G is equal to n. Thus the result follows easily. Lemma 9. Let G be a connected graph on n 5 vertices. Suppose that both G and G have diameter 3. Then RCWGRCWG 5nn with equality if and only if dg, 3 = dg, 3 =. Proof. Let t k = dg, k and t k = dg, k. Obviously, t t 3 = t, t t 3 = t and t t = nn. Then RCWG RCWG = 3 k= t k t k k = t t t t 3 t t 3 t 3 t 3 3 = t t 3 t t 5nn = t 3 t 3 5nn with equality if and only if t 3 = t 3 =. t 3 t 3 = 5 6 t t t 3 t 3 It is easily seen that there are pairs of graphs on n vertices such that both of them have diameter three and t 3 = t 3 =. For example, if n = 5, then there is exactly one pair G and G : the graph formed from the path P 5 by adding an edge between the two neighbors of its center and its complement which is isomorphic to itself such that RCWGRCWG = 8 = 5nn. 3 Proposition 0. Let G be a connected graph on n 5 vertices with a connected G. Then 3nn RCWG RCWG with equality if and only if both G and G have diameter, whilst n 5n 6 for n 9 RCWG RCWG 5nn for 5 n 8 with equality if and only if G = P n or G = P n for n 9, and both G and G have diameter three with dg, 3 = dg, 3 = for 5 n 8.
6 B. Zhou et al. / iscrete Applied Mathematics Proof. Let m and m be respectively the number of edges of G and G. Then m m = nn. By Proposition, nn RCWG RCWG m nn m = nn m m 3nn = with equality if and only if both G and G have diameter. On the other hand, note that either both G and G have diameter 3 or one of them has diameter, and that 5nn > n 5n 6 if and only if n 9. The second part of the proposition follows from Lemmas 8 and 9. Acknowledgements BZ and XC were supported by the National Natural Science Foundation of China Grant No and NT by the Ministry of Science, Education and Sports of Croatia Grant No References []. Bonchev, Information Theoretic Indices for Characterization of Chemical Structures, Research Studies Press/Wiley, Chichester, 983, 7 7. []. Bonchev, N. Trinajstić, Information theory, distance matrix, and molecular branching, J. Chem. Phys [3] I. Gutman, K.C. as, The first Zagreb index 30 years after, MATCH Commun. Math. Comput. Chem [] I. Gutman, N. Trinajstić, Graph theory and molecular orbitals. III. Total π-electron energy of alternant hydrocarbons, Chem. Phys. Lett [5] P.J. Hansen, J.P. Jurs, Chemical applications of graph theory. Part I. Fundamentals and topological indices, J. Chem. Educ [6] H. Hosoya, Topological index. A newly proposed quantity characterizing the topological nature of structural isomers of saturated hydrocarbons, Bull. Chem. Soc. Japan [7] O. Ivanciuc, QSAR comparative study of Wiener descriptors for weighted molecular graphs, J. Chem. Inf. Comput. Sci [8] O. Ivanciuc, T. Ivanciuc, A.T. Balaban, The complementary distance matrix, a new molecular graph metric, ACH-Models Chem [9] O. Ivanciuc, T. Ivanciuc, A.T. Balaban, Quantitative structure-property relationship evaluation of structural descriptors derived from the distance and reverse Wiener matrices, Internet Electron. J. Mol. es [0] O. Ivanciuc, T. Ivanciuc, A.T. Balaban, Vertex- and edge-weighted molecular graphs and derived structural descriptors, in: J. evillers, A.T. Balaban Eds., Topological Indices and Related escriptors in QSAR and QSPR, Gordon and Breach, The Netherlands, 999, pp []. Janežič, A. Miličević, S. Nikolić, N. Trinajstić, Graph Theoretical Matrices in Chemistry, in: Mathematical Chemistry Monographs, vol. 3, University of Kragujevac, Kragujevac, 007, a pp. 6 6, b pp , c pp [] S. Nikolić, G. Kovačević, A. Miličević, N. Trinajstić, The Zagreb indices 30 years after, Croat. Chem. Acta [3] S. Nikolić, N. Trinajstić, Z. Mihalić, The Wiener index: evelopment and applications, Croat. Chem. Acta [] E.A. Nordhaus, J.W. Gaddum, On complementary graphs, Amer. Math. Monthly [5] O. Ore, iameters in graphs, J. Combin. Theory [6] J. Plesník, On the sum of all distance in a graph or digraph, J. Graph Theory [7] O.E. Polansky, On the modelling of Wiener numbers, in: A. Graovac Ed., MATH/CHEM/COMP 988, Elsevier, Amsterdam, 989, pp [8].H. Rouvray, Predicting chemistry from topology, Sci. Amer [9].H. Rouvray, The rich legacy of half a century of the Wiener index, in:.h. Rouvray and R.B. King Eds., Topology in Chemistry iscrete Mathematics of Molecules, Horwood, Chichester, 00, pp [0] R. Todeschini, V. Consonni, Handbook of Molecular escriptors, Wiley-VCH, Weinheim, 000. [] N. Trinajstić, Chemical Graph Theory, nd revised ed., CRC Press, Boca Raton, 99, a pp., b pp [] H. Wiener, Structural determination of paraffin boiling points, J. Am. Chem. Soc [3] R.J. Wilson, Introduction to Graph Theory, Oliver and Boyd, Edinburgh, 97, a p. 9, b p. 3, c p. 0. [] L. Zhang, B. Wu, The Nordhaus Gaddum-type inequalities for some chemical indices, MATCH Commun. Math. Comput. Chem [5] B. Zhou, X. Cai, N. Trinajstić, On Harary index, J. Math. Chem [6] B. Zhou, I. Gutman, Relationships between Wiener, hyper-wiener and Zagreb indices, Chem. Phys. Lett
On a Class of Distance Based Molecular Structure Descriptors
On a Class of Distance Based Molecular Structure Descriptors Franka Miriam Brückler a, Tomislav Došlić b, Ante Graovac c, Ivan Gutman d, a Department of Mathematics, University of Zagreb, Bijenička 30,
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 [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 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 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 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 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 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 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 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 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 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 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 informationWIENER INDICES OF BENZENOID GRAPHS*
Bulletin of the Chemists and Technologists of Macedonia, Vol., No., pp. 9 (4 GHTMDD 444 ISSN 5 6 Received: February, 4 UDC: 547 : 54 Accepted: March 8, 4 Original scientific paper WIENER INDICES OF BENZENOID
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 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] 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 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 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 informationOn the Randić Index of Polyomino Chains
Applied Mathematical Sciences, Vol. 5, 2011, no. 5, 255-260 On the Randić Index of Polyomino Chains Jianguang Yang, Fangli Xia and Shubo Chen Department of Mathematics, Hunan City University Yiyang, Hunan
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 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 informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More 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 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 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 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 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 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 informationComputing distance moments on graphs with transitive Djoković-Winkler s relation
omputing distance moments on graphs with transitive Djoković-Winkler s relation Sandi Klavžar Faculty of Mathematics and Physics University of Ljubljana, SI-000 Ljubljana, Slovenia and Faculty of Natural
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 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 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 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 informationActa Chim. Slov. 2003, 50,
Acta Chim. Slov. 2003, 50, 83 94. 83 SOME TOPOLOGICAL INDICES DERIVED FROM THE v m d n MATRIX. PART 6. SUMMATION-DERIVED DIFFERENCE TYPE INDICES OF BI A CLASS Anton Perdih,* Branislav Perdih Mala vas 12,
More informationKey words: matching polynomial; acyclic polynomial; matching generating polynomial; perfect matching; Hosoya index; Pfaffian orientation
On the Matching Polynomials of Graphs with Small Number of Cycles of Even Length WEIGEN YAN,, YEONG-NAN YEH, FUJI ZHANG 3 School of Sciences, Jimei University, Xiamen 360, China Institute of Mathematics,
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 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 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 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 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 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 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 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 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 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 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 informationModified Zagreb M 2 Index Comparison with the Randi} Connectivity Index for Benzenoid Systems
CROATICA CHEMICA ACTA CCACAA 7 (2) 83 87 (2003) ISSN-00-3 CCA-2870 Note Modified Zagreb M 2 Index Comparison with the Randi} Connectivity Index for Benzenoid Systems Damir Vuki~evi} a, * and Nenad Trinajsti}
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 informationOn the distance and distance signless Laplacian eigenvalues of graphs and the smallest Gersgorin disc
Electronic Journal of Linear Algebra Volume 34 Volume 34 (018) Article 14 018 On the distance and distance signless Laplacian eigenvalues of graphs and the smallest Gersgorin disc Fouzul Atik Indian Institute
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 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 informationEnumeration of subtrees of trees
Enumeration of subtrees of trees Weigen Yan a,b 1 and Yeong-Nan Yeh b a School of Sciences, Jimei University, Xiamen 36101, China b Institute of Mathematics, Academia Sinica, Taipei 1159. Taiwan. Theoretical
More informationON GLOBAL DOMINATING-χ-COLORING OF GRAPHS
- TAMKANG JOURNAL OF MATHEMATICS Volume 48, Number 2, 149-157, June 2017 doi:10.5556/j.tkjm.48.2017.2295 This paper is available online at http://journals.math.tku.edu.tw/index.php/tkjm/pages/view/onlinefirst
More 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 informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationCorrelation of domination parameters with physicochemical properties of octane isomers
Correlation of domination parameters with physicochemical properties of octane isomers Sunilkumar M. Hosamani Department of mathematics, Rani Channamma University, Belgaum, India e-mail: sunilkumar.rcu@gmail.com
More informationHarmonic Temperature Index of Certain Nanostructures Kishori P. Narayankar. #1, Afework Teka Kahsay *2, Dickson Selvan. +3
International Journal of Mathematics Trends and Technology (IJMTT) Volume 56 Number - April 018 Harmonic Temperature Index of Certain Nanostructures Kishori P. Narayankar. #1, Afework Teka Kahsay *, Dickson
More informationApplications of Isometric Embeddings to Chemical Graphs
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Applications of Isometric Embeddings to Chemical Graphs Sandi Klavžar Abstract. Applications of isometric embeddings of benzenoid
More informationHow Good Can the Characteristic Polynomial Be for Correlations?
Int. J. Mol. Sci. 2007, 8, 335-345 International Journal of Molecular Sciences ISSN 1422-0067 2007 by MDPI www.mdpi.org/ijms/ Full Research Paper How Good Can the Characteristic Polynomial Be for Correlations?
More informationThe PI Index of the Deficient Sunflowers Attached with Lollipops
Int. J. Contemp. Math. Sciences, Vol. 6, 011, no. 41, 001-007 The PI Index of the Deficient Sunflowers Attached with Lollipops Min Huang Institute of Mathematics Physics and Information Sciences Zhejiang
More 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 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 informationAn Application of the permanent-determinant method: computing the Z-index of trees
Department of Mathematics wtrnumber2013-2 An Application of the permanent-determinant method: computing the Z-index of trees Daryl Deford March 2013 Postal address: Department of Mathematics, Washington
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
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 informationWiener Indices and Polynomials of Five Graph Operators
Wiener Indices and Polynomials of Five Graph Operators Weigen Yan School of Sciences, Jimei University Xiamen 36101, China, and Academia Sinica Taipei, Taiwan wgyan@math.sinica.edu.tw Yeong-Nan Yeh Inst.
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
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 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 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 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 informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 1295 1300 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml The Roman domatic number of a graph S.M.
More informationarxiv: v1 [math.co] 15 Sep 2016
A Method for Computing the Edge-Hyper-Wiener Index of Partial Cubes and an Algorithm for Benzenoid Systems Niko Tratnik Faculty of Natural Sciences and Mathematics, University of Maribor, Slovenia arxiv:1609.0469v1
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 informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationCALCULATING THE DEGREE DISTANCE OF PARTIAL HAMMING GRAPHS
CALCULATING THE DEGREE DISTANCE OF PARTIAL HAMMING GRAPHS Aleksandar Ilić Faculty of Sciences and Mathematics, University of Niš, Serbia e-mail: aleksandari@gmail.com Sandi Klavžar Faculty of Mathematics
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 informationOn Kites, Comets, and Stars. Sums of Eigenvector Coefficients in (Molecular) Graphs
On Kites, Comets, and Stars. Sums of Eigenvector Coefficients in (Molecular) Graphs Gerta Rücker, Christoph Rücker a, and Ivan Gutman b Department of Rehabilitative and Preventative Sports Medicine, University
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More information