On the Geometric Arithmetic Index
|
|
- Charleen McGee
- 5 years ago
- Views:
Transcription
1 MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun Math Comput Chem 74 (05) 03-0 ISSN On the Geometric Arithmetic Index José M Rodríguez a, José M Sigarreta b a Departamento de Matemáticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, 89 Leganés, Madrid, Spain jomaro@mathuc3mes b Facultad de Matemáticas, Universidad Autónoma de Guerrero, Carlos E Adame No54 Col Garita, Acalpulco Gro, México jsmathguerrero@gmailcom (Received September 30, 04) Abstract The concept of geometric-arithmetic index was introduced in the chemical graph theory recently, but it has shown to be useful The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index GA and characterize graphs extremal with respect to them In particular, we improve some known inequalities and we relate GA to other well known topological indices Introduction A single number, representing a chemical structure in graph-theoretical terms via the molecular graph, is called a topological descriptor and if it in addition correlates with a molecular property it is called topological index; it is used to understand physicochemical properties of chemical compounds Topological indices are interesting since they capture some of the properties of a molecule in a single number Hundreds of topological indices have been introduced and studied, starting with the seminal work by Wiener [30] in which he used the sum of all shortest-path distances of a (molecular) graph for modeling physical properties of alkanes Topological indices based on end-vertex degrees of edges have been used over 40 years Among them, several indices are recognized to be useful tools in chemical researches
2 -04- Probably, the best know such descriptor is the Randić connectivity index (R) [5] There are more than thousand papers and a couple of books dealing with this index (see, eg, [3], [7], [8] and the references therein) During many years, scientists were trying to improve the predictive power of the Randić index This led to the introduction of a large number of new topological descriptors resembling the original Randić index The first geometric-arithmetic index GA, defined in [8] as GA (G) = (d u + d v ) where uv denotes the edge of the graph G connecting the vertices u and v, and d u is the degree of the vertex u, is one of the successors of the Randić index Although GA was introduced just five years ago, there are many papers dealing with this index There are other geometric-arithmetic indices, like Z p,q (Z 0, = GA ), but the results in [7, p598] show empirically that the GA index gathers the same information on observed molecules as other Z p,q indices The reason for introducing a new index is to gain prediction of some property of molecules somewhat better than obtained by already presented indices Therefore, a test study of predictive power of a new index must be done As a standard for testing new topological descriptors, the properties of octanes are commonly used We can find 6 physico-chemical properties of octanes at wwwmoleculardescriptorseu The GA index gives better correlation coefficients than Randić index for these properties, but the differences between them are not significant However, the predicting ability of the GA index compared with Randić index is reasonably better (see [7, Table ]) Although only about 000 benzenoid hydrocarbons are known, the number of possible benzenoid hydrocarbons is huge For instance, the number of possible benzenoid hydrocarbons with 35 benzene rings is [4] Therefore, the modeling of their physico-chemical properties is very important in order to predict properties of currently unknown species The graphic in [7, Fig7] (from [7, Table ], [7]) shows that there exists a good linear correlation between GA and the heat of formation of benzenoid hydrocarbons (the correlation coefficient is equal to 097) Furthermore, the improvement in prediction with GA index comparing to Randić index in the case of standard enthalpy of vaporization is more than 9% Hence, one can think that GA index should be considered in the QSPR/QSAR researches
3 -05- The aim of this paper is to obtain new inequalities involving the geometric-arithmetic index GA and characterize graphs extremal with respect to them In particular, we improve some known inequalities in Theorems 4, 37 and 30, and we relate GA to other well known topological indices in Section 3 Throughout this paper, G = (V (G), E(G)) denotes a (non-oriented) finite simple (without multiple edges and loops) connected graph with E(G) Note that the connectivity of G is not an important restriction, since if G has connected components G,, G r, then GA (G) = GA (G )+ +GA (G r ); furthermore, every molecular graph is connected Bounds for Geometric-Arithmetic Index We start with the following elementary result which allows to compute GA for many graphs Recall that a (, δ)-biregular graph is a bipartite graph for which any vertex in one side of the given bipartition has degree and any vertex in the other side of the bipartition has degree δ Proposition Let G be any graph Then the following statements hold: G is a regular graph if and only if GA (G) = m If G is a (, δ)-biregular graph, then GA (G) = m δ + δ If C n is the cycle graph with n vertices, then GA (C n ) = n If K n is the complete graph with n vertices, then GA (K n ) = ( n ) If Q n is the n-cube graph with n vertices, then GA (Q n ) = n n If K n,n is the complete bipartite graph with n, n vertices, then GA (K n,n ) = (n n ) 3/ n + n If S n is the star graph with n vertices, then GA (S n ) = (n )3/ n
4 -06- If W n is the wheel graph with n vertices, then GA (W n ) = n n + (n )3/ If P n is the path graph with n vertices, then GA (P ) =, GA (P n ) = n 3 + 4, if n 3 3 The double star graph S n,n is the graph consisting of the union of two star graphs S n+ and S n+ together with an edge joining their centers We have GA (S n,n ) = n n + n + + n n + n + + (n + )(n + ) n + n + If K n,,nk is the complete multipartite graph with n = n + + n k vertices, then k GA (K n,,nk ) = We will need the following result k i= j=i+ Lemma Let f be the function f(t) = n i n j (n ni )(n n j ) n n i n j t on the interval [0, ) Then f strictly +t increases in [0, ], strictly decreases in [, ), f(t) = if and only if t = and f(t) = f(t 0 ) if and only if either t = t 0 or t = t 0 Proof The statements follow from f (t) = ( t ) ( + t ) Corollary 3 Let g be the function g(x, y) = xy x+y ab g(x, y) a + b with 0 < a x, y b Then The equality in the lower bound is attained if and only if either x = a and y = b, or x = b and y = a, and the equality in the upper bound is attained if and only if x = y Besides, g(x, y) = g(x, y ) if and only if x/y is equal to either x /y or y /x Proof It suffices to apply Lemma, since g(x, y) = f(t) with t = x, and a t y b b a
5 -07- In [] and [8] (see also [7, p609-60]) appear the following inequalities: GA (G) (n )3/ n, GA (G) m n () Our next result provides a lower bound of GA (G) depending just on n and m, improving both inequalities in () Theorem 4 We have for any graph G GA (G) m n, n and the equality is attained if and only if G is a star graph Proof Recall that d u n for every u V (G) By Corollary 3, taking a = and b = n, we have GA (G) = d u d v (n ) n + = m n n By Corollary 3, the equality holds for G if and only if every edge joins a vertex of degree with a vertex of degree n, and this holds if and only if G is a star graph In [6] (see also [7, p609-60]) we find the bounds m δ + δ GA (G) m () In the papers [9] and [3] the authors obtain lower bounds of sum-connectivity and harmonic indices, respectively, depending just on n, for every graph with δ The following inequality provides a lower bound of GA (G) for every graph G with δ k, for any fixed k This result improves the first inequality in () Theorem 5 Consider any graph G with δ k () If n 0, then () If n, then GA (G) min GA (G) nk { nk } (k + ) k (n ) 3/, n + k
6 -08- Proof We have m = v V (G) We obtain from this inequality and () GA (G) m δ + δ where we consider the function for t [δ, n ] Since we have U (t) = 0 if and only if d v (n )δ + ( (n )δ + ) δ + δ = δ U( ), U(t) = ( (n )δ + t ) t t + δ = t3/ + (n )δt / t + δ U (t) = t + (4 n)δt + (n )δ t (t + δ), t = t ± = δ ( n 4 ± (n )(n 0) ) Hence, if n 0 then U (t) 0 for every t, and we conclude U(t) U(δ) for every t [δ, n ] Therefore, GA (G) δ U( ) δ U(δ) = nδ nk Assume now that n, then t, t + R and t < t + Since (n )(n 0) < n 6, we have δ = δ ( ) δ ( ) n 4 (n 6) < n 4 (n )(n 0) = t Furthermore, since n and δ, (n )(n 0) 3 and n δ We have two possibilities: ( ) δ ( ) n n 4 + (n )(n 0) = t+ (i) If t < n, then δ < t < n t +, U increases on [δ, t ] and decreases on [t, n ], and U(t) min { U(δ), U(n )} for every t [δ, n ] (ii) If n t, then δ n t, U increases on [δ, n ], and U(t) U(δ) = min { U(δ), U(n ) } for every t [δ, n ]
7 -09- Hence, in both cases GA (G) δ U( ) δ min { U(δ), U(n ) } = min min { nk } (k + ) k (n ) 3/, n + k { nδ } (δ + ) δ (n ) 3/, n + δ Remark 6 One can check that if k =, then { } { min n, 3 (n ) 3/ n, if n =, = 3 (n ) n + 3/, if n, n+ and that if k = 3, then { 3n min, 4 } 3 (n ) 3/ = n + { 3n, if n =,, 4 3 (n ) 3/ n+, if n 3 The study of Gromov hyperbolic graphs is a subject of increasing interest, both in pure and applied mathematics (see, eg, [], [], [3], [4], [0] and the references cited therein) We say that a graph is t-hyperbolic (t 0) if any side of every geodesic triangle is contained in the t-neighborhood of the union of the other two sides We define the hyperbolicity constant δ(g) of a graph G as the infimum of the constants t 0 such that G is t-hyperbolic We consider that every edge has length The following inequality relates the geometric-arithmetic index with the hyperbolicity constant δ(g) Theorem 7 We have for any graph G that is not a tree GA (G) (4δ(G) )3/ 4δ(G) Proof It is well known that if G is not a tree then δ(g) > 0 We have that δ(g) is always an integer multiple of by [, Theorem 6] and that δ(g) / {, } by [0, Theorem ], 4 4 since G has not loops or multiple edges Hence, δ(g) 3 4 The function f(x) = (x )3/ x f (x) = for every x (, ) We know by () that is increasing in [, ), since (x )/ x ( x + ) > 0 GA (G) (n )3/ n
8 -0- Since δ(g) n by [0, Theorem 30], we have n 4δ(G) 3 and 4 GA (G) (n )3/ n (4δ(G) )3/ 4δ(G) One can think that perhaps it is possible to obtain an upper bound of GA (G) in terms of δ(g), ie, the inequality GA (G) Ψ ( δ(g) ), for every graph G and some function Ψ However, this is not possible, as the following example shows For each integer d 3 consider two copies A d and B d of the path graph with (ordered) vertices a,, a d and b,, b d, respectively Let G d be the graph obtained from A d and B d by connecting with an edge the vertices a i and b i for every i {,, d} One can check that δ(g) = 3 for every d 3 However, lim d GA (G d ) = 3 Relations between GA and other well known topological indices In order to obtain relations between GA and other well known topological indices we need the following classical result, which provides a converse of Cauchy-Schwarz inequality (see [5, p6]) Lemma 3 If 0 < n a j N and 0 < n b j N for j k, then ( k j= a j ) / ( k j= b j ) / ( ) ( k ) N N n n + a j b j n n N N j= We will denote by M (G) and M (G) the first and the second Zagreb indices of the graph G, respectively, defined in [4] as M (G) = u V (G) d u, M (G) = d u d v These indices have attracted growing interest, see eg, [5], [4], [9] (in particular, they are included in a number of programs used for the routine computation of topological indices)
9 -- In [8] (see also [7, p6]) we find the bound mm (G) GA (G) (33) δ The following result gives a lower bound for GA similar to (33) Proposition 3 We have for any graph G GA (G) δ mm (G) + δ, and the equality is attained if and only if G is a regular graph Proof Since Lemma 3 gives GA (G) = δ d u d v, d u d v δ ( M (G) ) ( / + δ (d u + d v ) δ, ( ) / ( d ud v ( ) + δ δ ) / δ mm (G) + δ ) / 4 (d u+d v) If the graph is regular (ie, δ = ), then the lower and upper bound are the same, and they are equal to GA (G) If we have the equality, then 4( ) = for every uv E(G); hence, d u = for every u V (G) and the graph is regular We will use the following particular case of Jensen s inequality Lemma 33 If f is a convex function in R + and x,, x m > 0, then [5] as f ( x + + x ) m ( f(x ) + + f(x m ) ) m m As we have said, we will denote by R(G) the Randić index of the graph G, defined in R(G) = We recall that probably R is the best know topological index (see, eg, [3], [7], [8], [6] and the references cited therein) The following result provides lower and upper bounds of GA involving the Randić index
10 -- Theorem 34 We have for any graph G m R(G) GA (G) R(G), and the equality in each inequality holds if and only if G is regular Proof Since f(x) = /x is a convex function in R +, Lemma 33 gives m dud v (du+dv) m m GA (G) R(G) m (d u + d v ) m, If the equality holds, then ( ) = for every uv E(G) and we conclude d u = for every u V (G) In order to prove the upper bound note that GA (G) = (d u + d v ) (d u + d v ) = R(G) If the equality holds, then ( ) = for every uv E(G) and we conclude d u = for every u V (G) Reciprocally, if G is regular, then R(G) = m Hence, the lower and upper bound are the same, and they are equal to m = GA (G) Remark 35 If we replace the function f(x) = /x by the convex function f(x) = x in the proof of Theorem 34, we obtain the known inequality (33) We will need also the following lemma Lemma 36 We have for any graph G m M (G) Furthermore, the equality is attained if only if G is regular or biregular Proof Note that in the sum ( ) each term d u appears exactly d u times, since u is the endpoint of precisely d u edges Hence, ( ) = u V (G) d u = M (G),
11 -3- and Cauchy-Schwarz inequality gives m = du + d v du + d v = M (G) ( ) Furthermore, by Cauchy-Schwarz inequality, the inequality is attained if only if there exists a constant µ such that, for every uv E(G), du + d v = µ, = µ (34) If uv, uw E(G), then µ = = d u + d w, d w = d v, and we conclude that (34) is equivalent to the following: for each vertex u V (G), every neighbor of u has the same degree Since G is connected, this holds if and only if G is regular or biregular In [] (see also [7, p60]) appears the inequality GA (G) M (G) (35) Our next result improves this inequality and also gives a lower bound of GA involving the first Zagreb index Theorem 37 We have for any graph G δm M (G) GA (G) δ M (G) Furthermore, the equality in each inequality is attained if and only if G is regular Proof First of all we have GA (G) m = u V (G) d u u V (G) d u δ = δ M (G) If we have the equality, then GA (G) = m and G is regular If the graph is regular, then M (G) = nδ = mδ, GA (G) = m and the equality holds
12 -4- Lemma 36 gives GA (G) = d u d v δ δm M (G) If the equality holds, then d u d v = δ for every uv E(G); hence, d u = δ for every u V (G) and the graph is regular If G is regular, then M (G) = nδ = mδ, GA (G) = m and the equality holds M The following result gives a lower bound for GA involving the Zagreb indices M and Theorem 38 We have for any graph G GA (G) δm + δ M (G), M (G) and the equality is attained if and only if G is a regular graph Proof Since Lemmas 3 and 36 give GA (G) = δ d u d v, d u d v δ ( M (G) ) ( / δ, ( ) / ( d ud v ( ) + δ δ ) / d u+d v δm + δ + δ ) / 4 (d u+d v) M (G) M (G) If the equality holds, then (d u+d v ) = for every uv E(G); hence, d u = for every u V (G) If G is regular, then M (G) = n = m, M (G) = m, GA (G) = m and we have the equality We deal now with two additional topological descriptors, called harmonic and sumconnectivity index, defined respectively as H(G) =, S(G) = du + d v These indices have attracted a great interest in the lasts years (see, eg, [9], [0], [6], [9], [3], [3], [33] and [34]) Next, we relate them with the geometric-arithmetic index
13 -5- Proposition 39 We have for any graph G δh(g) GA (G) H(G), and the equality in each inequality is attained if and only if G is regular Proof We have δ, for every uv E(G) Hence, we obtain the inequalities by summing in uv E(G) The equality in the first (respectively, second) inequality is attained if and only if = δ for every uv E(G), ie, d u = δ (respectively, d u = ) for every u V (G) Reciprocally, if G is regular, then both bounds have the same value, and they are equal to GA (G) Next, we obtain inequalities relating the geometric-arithmetic index with the second Zagreb index Note that, since nδ m by the handshaking lemma, the upper bound improves the known inequality (33) Theorem 30 We have for any graph G δmm (G) nm (G) GA (G), + δ δ and the equality in each inequality is attained if and only if G is a regular graph Proof Since δ (d u + d v ), Lemma 3 gives ( GA (G) = ) / ( 4d ud v ) / (d u + d v ) (d u+d v) ( ) + δ δ δm / + δ d ud v = δmm (G) + δ In order to prove the upper bound, fix any function h Note that in the sum ( h(du )+ h(d v ) ) each term h(d u ) appears exactly d u times, since u is the endpoint of precisely d u edges Hence, ( h(du ) + h(d v ) ) = u V (G) d u h(d u ), ( d u + d v ) = u V (G) d u d u = n
14 -6- Therefore, Lemma 33 with f(x) = x gives Cauchy-Schwarz inequality gives GA (G) = d u d v (M (G)) / δ ( + ) = n d u d v d u d v / / nm (G) δ 4 ( ) If the graph is regular, then the lower and upper bound are the same, and they are equal to GA (G) If the equality holds in the lower bound, then 4( ) = for every uv E(G); hence, d u = for every u V (G) and the graph is regular If the equality is attained in the upper bound, then ( ) = δ for every uv E(G) and we conclude d u = δ for every u V (G) Theorem 3 We have for any graph G δs(g) GA (G) S(G) m and the equality in each inequality holds if and only if G is regular Proof Since f(x) = x is a convex function in R +, Lemma 33 gives δs(g) = δ ( ) / m m du + d v m m d u d v = m GA (G) If the equality holds, then d u d v = δ for every uv E(G) and we conclude d u = δ for every u V (G) In order to prove the upper bound note that GA (G) = d u d v d u + d v =, du + d v du + d v d u d v = d u d v du + d v du + d v du + d v = S(G) /
15 -7- If the equality holds, then = for every uv E(G) and we conclude d u = for every u V (G) Reciprocally, if G is regular, then S(G) = are the same, and they are equal to m = GA (G) Theorem 3 We have for any graph G GA (G) S(G) R(G), and the equality holds if and only if G is regular or biregular Proof Using the Cauchy-Schwarz inequality, we obtain S(G) = du + d v m Hence, the lower and upper bound = d u d v d u d v (d u d v ) /4 = GA (G)R(G) Hence, the equality is attained if and only if there exists a constant c such that for every uv E(G) d u d v If uv, uw E(G), then = c (d u d v ), d ud /4 v = c ( ), c = + = +, d w = d v, d u d v d u d w c = d u + d v (36) and we conclude that (36) is equivalent to the following: for each vertex u V (G), every neighbor of u has the same degree Since G is connected, this holds if and only if G is regular or biregular The modified Narumi-Katayama index NK = NK (G) = u V (G) d du u = is introduced in [], inspired in the Narumi-Katayama index defined in [3] (see also [], []) Next, we prove an inequality relating the modified Narumi-Katayama index with the geometric-arithmetic index d u d v
16 -8- Theorem 33 We have for any graph G GA (G) m NK (G) /(m), and the equality holds if and only if G is regular Proof Using the fact that the geometric mean is at most the arithmetic mean, we obtain m GA (G) = m m d u d v /m d u d v /m = NK (G) /(m) If the equality holds, then ( ) = for every uv E(G); hence, d u = for every u V (G) and the graph is regular If the graph is regular, then NK (G) = m and the equality holds Acknowledgement: Supported in part by a grant from Ministerio de Economía y Competititvidad (MTM ), Spain, and by a grant from CONACYT (CONACYT-UAG I00/6/0), México References [] S Bermudo, J M Rodríguez, J M Sigarreta, Computing the hyperbolicity constant, Comput Math Appl 6 (0) [] S Bermudo, J M Rodríguez, J M Sigarreta, E Tourís, Hyperbolicity and complement of graphs, Appl Math Lett 4 (0) [3] S Bermudo, J M Rodríguez, J M Sigarreta, J M Vilaire, Gromov hyperbolic graphs, Discr Math 33 (03) [4] G Brinkmann, J Koolen, V Moulton, On the hyperbolicity of chordal graphs, Ann Comb 5 (00) 6 69 [5] K C Das, On comparing Zagreb indices of graphs, MATCH Commun Math Comput Chem 63 (00) [6] K C Das, On geometric arithmetic index of graphs, MATCH Commun Math Comput Chem 64 (00)
17 -9- [7] K C Das, I Gutman, B Furtula, Survey on geometric arithmetic indices of graphs, MATCH Commun Math Comput Chem 65 (0) [8] K C Das, I Gutman, B Furtula, On first geometric arithmetic index of graphs, Discr Appl Math 59 (0) [9] H Deng, S Balachandran, S K Ayyaswamy, Y B Venkatakrishnan, On the harmonic index and the chromatic number of a graph, Discr Appl Math 6 (03) [0] Z Du, B Zhou, N Trinajstić, Minimum sum connectivity indices of trees and unicyclic graphs of a given matching number, J Math Chem 47 (00) [] M Ghorbani, M Songhori, I Gutman, Modified Narumi Katayama index, Kragujevac J Sci 34 (0) [] I Gutman, A property of the simple topological index, MATCH Commun Math Comput Chem 5 (990) 3 40 [3] I Gutman, B Furtula (Eds), Recent Results in the Theory of Randić Index, Univ Kragujevac, Kragujevac, 008 [4] I Gutman, N Trinajstić, Graph theory and molecular orbitals Total π-electron energy of alternant hydrocarbons, Chem Phys Lett 7 (97) [5] G H Hardy, J E Littlewood, G Pólya, Inequalities, Cambridge University Press, 95 [6] S A Hosseini, M B Ahmadi, I Gutman, Kragujevac trees with minimal atom bond connectivity index, MATCH Commun Math Comput Chem 7 (04) 5 0 [7] X Li, I Gutman, Mathematical Aspects of Randić Type Molecular Structure Descriptors, Univ Kragujevac, Kragujevac, 006 [8] X Li, Y Shi, A survey on the Randić index, MATCH Commun Math Comput Chem 59 (008) 7 56 [9] M Liu, A simple approach to order the first Zagreb indices of connected graphs, MATCH Commun Math Comput Chem 63 (00) [0] J Michel, J M Rodríguez, J M Sigarreta, V Villeta, Hyperbolicity and parameters of graphs, Ars Comb 00 (0) [] M Mogharrab, G H Fath Tabar, Some bounds on GA index of graphs, MATCH Commun Math Comput Chem 65 (00) 33 38
18 -0- [] H Narumi, New topological indices for finite and infinite systems, MATCH Commun Math Comput Chem (987) [3] H Narumi, M Katayama, Simple topological index A newly devised index characterizing the topological nature of structural isomers of saturated hydrocarbons, Mem Fac Engin Hokkaido Univ 6 (984) 09 4 [4] M Vöge, A J Guttmann, I Jensen, On the number of benzenoid hydrocarbons, J Chem Inf Comput Sci 4 (00) [5] M Randić, On characterization of molecular branching, J Am Chem Soc 97 (975) [6] J A Rodríguez, J M Sigarreta, On the Randić index and condicional parameters of a graph, MATCH Commun Math Comput Chem 54 (005) [7] TRC Thermodynamic Tables Hydrocarbons; Thermodynamic Research Center, The Texas A & M University System: College Station, TX, 987 [8] D Vukičević, B Furtula, Topological index based on the ratios of geometrical and arithmetical means of end vertex degrees of edges, J Math Chem 46 (009) [9] S Wang, B Zhou, N Trinajstić, On the sum connectivity index, Filomat 5 (0) 9 4 [30] H Wiener, Structural determination of paraffin boiling points, J Am Chem Soc 69 (947) 7 0 [3] R Wua, Z Tanga, H Deng, A lower bound for the harmonic index of a graph with minimum degree at least two, Filomat 7 (03) 5 55 [3] R Xing, B Zhou, N Trinajstić, Sum connectivity index of molecular trees, J Math Chem 48 (00) [33] L Zhong, The harmonic index for graphs, Appl Math Lett 5 (0) [34] L Zhong, K Xu, Inequalities between vertex degree based topological Indices, MATCH Commun Math Comput Chem 7 (04) 67 64
New Lower Bounds for the First Variable Zagreb Index
arxiv:1806.02063v1 [math.co] 6 Jun 2018 New Lower Bounds for the First Variable Zagreb Index Alvaro Martínez-Pérez a, José M. Rodríguez b June 7, 2018 a Facultad de Ciencias Sociales, Universidad de Castilla-La
More 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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: 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 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 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 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 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 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 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 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 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 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 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 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 informationOn the Hyperbolicity Constant of Line Graphs
On the Hyperbolicity Constant of Line Graphs Walter Carballosa José M. Rodríguez Departamento de Matemáticas Universidad Carlos III de Madrid Av. de la Universidad 30, 28911 Leganés, Madrid, Spain wcarball@math.uc3m.es,
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 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 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 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 informationGromov hyperbolicity in Cartesian product graphs
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 120, No. 5, November 2010, pp. 593 609. Indian Academy of Sciences Gromov hyperbolicity in Cartesian product graphs JUNIOR MICHEL 1, JOSÉMRODRÍGUEZ 1, JOSÉ M SIGARRETA
More informationREVISTA INVESTIGACIÓN OPERACIONAL VOL. 37, NO. 2, , 2016
REVISTA INVESTIGACIÓN OPERACIONAL VOL. 37, NO., 115-13, 016 COMPUTING THE STRONG ALLIANCE POLYNOMIAL OF A GRAPH W. Carballosa,, J. C. Hernández-Gómez,, O. Rosario, and Y. Torres-Nuñez, Cátedra CONACYT,
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 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 informationThe Forgotten Topological Index of Four Operations on Some Special Graphs Sirous Ghobadi 1,a *, Mobina Ghorbaninejad 2,b
Bulletin of Mathematical Sciences Applications Submitted: 2016-04-23 ISSN: 2278-9634, Vol. 16, pp 89-95 Accepted: 2016-07-06 doi:10.18052/www.scipress.com/bmsa.16.89 Online: 2016-08-04 2016 SciPress Ltd.,
More informationSome Computational Aspects for the Line Graph of Banana Tree Graph
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 6 (017), pp. 601-67 Research India Publications http://www.ripublication.com/gjpam.htm Some Computational Aspects for the
More informationTOPOLOGICAL PROPERTIES OF BENZENOID GRAPHS
U.P.B. Sci. Bull., Series B, Vol. 80, Iss.,, 08 ISSN 454-33 TOPOLOGICAL PROPERTIES OF BENZENOID GRAPHS Nazeran IDREES, Fida HUSSAIN, Afshan SADIQ 3 Topological index is a quantity uniquely defined for
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 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 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 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 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 informationOn the general sum-connectivity index and general Randić index of cacti
Akhter et al. Journal of Inequalities and Applications (2016) 2016:300 DOI 10.1186/s13660-016-1250-6 R E S E A R C H Open Access On the general sum-connectivity index and general Randić index of cacti
More 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 informationM-polynomials and Degree based Topological Indices for the Line Graph of Firecracker Graph
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 6 (017), pp. 749-776 Research India Publications http://www.ripublication.com/gjpam.htm M-polynomials and Degree based Topological
More informationEstrada Index of Graphs
Estrada Index of Graphs Mohammed Kasim 1 Department of Mathematics, University of Kashan, Kashan, Iran Email: kasimmd@kashanu.ac.ir Fumao Zhang, Qiang Wang Department of Mathematics, Xi an University of
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 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 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 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 informationComputing Banhatti Indices of Hexagonal, Honeycomb and Derived Networks
American Journal of Mathematical and Computer Modelling 018; 3(): 38-45 http://www.sciencepublishinggroup.com/j/ajmcm doi: 10.11648/j.ajmcm.018030.11 Computing Banhatti Indices of Hexagonal, Honeycomb
More informationWiener Index of Degree Splitting Graph of some Hydrocarbons
Wiener Index of Degree Splitting Graph of some carbons K. Thilakam A. Sumathi PG and Research Department of Mathematics Department of Mathematics Seethalakshmi Ramaswami College Seethalakshmi Ramaswami
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 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 informationMaximum Size of Maximally Irregular Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 76 (2016) 81-98 ISSN 0340-6253 Maximum Size of Maximally Irregular Graphs Batmend Horoldagva 1,2,, Lkhagva
More informationExtremal Graphs for Randić Energy
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 77 (2017) 77-84 ISSN 0340-6253 Extremal Graphs for Randić Energy Kinkar Ch. Das, Shaowei Sun Department
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 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 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 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 informationWIENER POLARITY INDEX OF QUASI-TREE MOLECULAR STRUCTURES
Open J. Math. Sci., Vol. (018), No.1, pp. 7-8 ISSN 5-01 Website: http://www.openmathscience.com WIENER POLARITY INDEX OF QUASI-TREE MOLECULAR STRUCTURES ZIHAO TANG, LI LIANG 1, WEI GAO Abstract. As an
More informationOn the Hyperbolicity of Edge-Chordal and Path-Chordal Graphs
Filomat 30:9 (2016), 2599 2607 DOI 10.2298/FIL1609599B Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at:http://www.pmf.ni.ac.rs/filomat On the Hyperbolicity of Edge-Chordal
More informationTHE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 4, 2016 THE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH HONG-HAI LI AND LI ZOU ABSTRACT. The matching energy of a graph was introduced
More 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 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 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 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 informationEnergy and Laplacian Energy of Graphs. ALI REZA ASHRAFI Department of Mathematics, University of Kashan, Kashan , I. R.
Energy and Laplacian Energy of Graphs ALI REZA ASHRAFI Department of Mathematics, University of Kashan, Kashan 87317-51167, I. R. Iran E-mail: ashrafi@kashanu.ac.ir Contents Laplacian Matrix Laplacian
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 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 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 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 information