On the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China
|
|
- Catherine Simpson
- 6 years ago
- Views:
Transcription
1 Journal of Mathematical Chemistry Vol. 38, No. 3, October 005 ( 005) DOI: 0.007/s On the Randić index Huiqing Liu School of Mathematics and Computer Science, Hubei University, Wuhan 43006, China liuhuiqing@eyou.com Mei Lu Department of Mathematical Sciences, Tsinghua University, Beijing 00084, China Feng Tian Institute of Systems Science, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing 00080, China Received 6 March 003; April 005 The Randić index of an organic molecule whose molecular graph is G is defined as the sum of (d(u)d(v)) / over all pairs of adjacent vertices of G, where d(u) is the degree of the vertex u in G. In Discrete Mathematics 57, 9 38 by Delorme et al. gave a best-possible lower bound on the Randić index of a triangle-free graph G with given minimum degree δ(g). In the paper, we first point out a mistake in the proof of their result (Theorem of [00]), and then we will show that the result holds when δ(g). KEY WORDS: connectivity index, Randić index, triangle-free graph, minimum degree AMS subject classification: 05C8. Introduction A single number which characterizes the graph of a molecular is called a graphtheoretical invariant or topological index. The structure property relationships quantity the connection between the structure and properties of molecules. The connectivity index is one of the most popular molecular-graph-based structure-descriptors (see [3]), and is defined in [] as C(λ) = C(λ; G) = (d(u)d(v)) λ, Corresponding author /05/ /0 005 Springer Science+Business Media, Inc.
2 346 H. Liu et al. / On the Randić index where d(u) denotes the degree of the vertex u of the molecular graph G, where the summation goes over all pairs of adjacent vertices of G and where λ is a pertinently chosen exponent. The respective structure-descriptor was introduced a quarter of century ago by Randić, who chose λ =(/), and now is referred to as the Randić index or molecular connectivity index or simply connectivity index. The Randić index has been closely correlated with many chemical properties [9]. It is viewed as a measure of branching of the carbon-atom skeleton, and hence the ordering of isomeric alkanes with respect to decreasing C(/)-values basically represents their ordering according to the increasing extent of branching. This index was found to parallel closely the boiling point, Kovats constants, and a calculated surface. However, other choice of λ were also considered (see [,7,8,]) and the exponent λ was treated (see [5,4,]) an adjustable parameter, chosen so as to optimize the correlation between C(λ) and some selected class of organic compounds. Comparing with other topological indexes reported by Amidon and Anik (see [0]), the Randić index appears to predict the boiling points of alkanes more closely, and only it takes into account the bonding or adjacency degree among carbons in alkanes. More data and additional references on C(λ) can be found in [6,7]. In order to discuss the Randić index of the molecular graph, we first introduced some terminologies and notations of graphs. Let G = (V, E) be a graph. For a vertex x of G, we denote the neighborhood and the degree of x by N(x) and d(x), respectively. The minimum degree of G is denoted by δ(g). We will use G x or G xy to denote the graph that arises from G by deleting the vertex x V (G) or the edge xy E(G). Similarly, G + xy is a graph that arises from G by adding an edge xy / E(G), where x,y V (G). Let G be a graph and uv E(G). The Randić weight or simply weight of the edge uv is R(uv) = / d(u)d(v). Then, the Randić index of a graph G, R(G) = C(/; G), is the sum of the weights of its edges. In [], Bollobás and Erdös show that R(G) n ifg is a connected graph of order n. In Delorme et al. [3], prove a lower bound on R(G) for δ(g). Theorem [3]. Let G = (V, E) be a graph of order n with δ(g). Then R(G) (n ) + n n with equality if and only if G = K,n. (Where K,n is a graph that arises from a complete bipartite graph K,n by joining the vertices in the part with vertices by a new edge). Note that K,n contains triangles and (n ) > (n )+ n n for n 4, and hence in [3], Delorme et al. gave a best-possible lower bound on R(G) in terms of δ when G is triangle-free as follows.
3 H. Liu et al. / On the Randić index 347 (Theorem of [3]). Let G = (V, E) be a triangle-free graph of order n with δ(g) δ. Then R(G) δ(n δ) with equality if and only if G = K δ,nδ. Although we find a mistake in the proof of Theorem of [3], we still believe that Theorem of [3] is correct. In section 3, we will show (Theorem of [3]) which supports Theorem. Theorem. Let G = (V, E) be a triangle-free graph of order n with δ(g). Then R(G) (n ).. Examples Let G be a triangle-free graph of order n with δ(g) δ and v 0 a vertex of minimum degree of G. In the proof of Theorem, the authors claimed that R(G v o ) δ(n δ ). ( ) We note that ( ) is not always true for all triangle-free graphs. The following graphs are the counterexamples. In order to depict construction of the counterexamples, we first define one kind of graph operation as follows. For a given graph H with V(H) = {v,...,v s }, we define the graph G(H, m)(m ) as follows. Take m disjoint copies H,...,H m of H, with the vertex vj i in H i corresponding to the vertex v j in H( j s, i m). Let G(H, m) be the graph obtained from H I H m by joining vj k and vk j+ (k k, j s(vs+ k = vk ) for k, k =,,...,m. Example. Regular graph. Let H = (V, E) be a graph with V ={v,v,v 3,v 4 } and E(H) ={v v,v 3 v 4 }. Denote G = G(H, m). Obviously, G is triangle-free. In the graph G, wehavethatn = 4m, δ(g) = m. Let v 0 be any vertex of G. It is easy to see that m (m )(m ) R(G v 0 )= + = + (m )(m ) (m )(m ) (m )(m ) and δ(n δ ) = m(m ).
4 348 H. Liu et al. / On the Randić index Since (m)(m ) (m )(m ) ( m ) ( m ) m m = > 0, m + m we have R(G v 0 )< δ(n δ ). Example. Non-regular graph. Let P 4 = v v v 3 v 4, a path of order 4, and let G = G(P 4,m). Obviously, G is triangle-free. In the graph G, wehavethatn = 4m, δ(g) = m. Let v 0 be any vertex of G with d(v 0 ) = δ(g) = m. Then and R(G v 0 ) = m(m + ) m(m ) + m(m ) + + m(m ) δ(n δ ) = m(m ). (m + )(m ) (m )(m ) (m )(m ) (m )(m ) It is checked (in Appendix A) that R(G v 0 )< δ(n δ ). Remark. Note that there is NO vertex with minimum degree such that ( ) holds in these graphs. 3. Proof of Theorem In order to prove Theorem, we first need some lemmas. Lemma []. Let x x be an edge of maximal weight in a graph G. Then R(G x x ) < R(G). Lemma. Let d,d,d be positive integers and f(d,d ) = ( d ) d + ( d ) d ( + ) ( ) d d ( )( ). d d If 3 d,d, d, then f(d,d ) ( d d ).
5 H. Liu et al. / On the Randić index 349 Proof. From the proof of Lemma in [3], we have f(d,d ) f(d,d) = ( ) ( d d + )( ). d d d d Obviously, d d > 0. On the other hand, by d 3, we have d d 3 > 0, hence f(d,d ) ( d d ). The following result holds from the proof of Theorem of [3]. Lemma 3. Let G = (V, E) be a triangle-free graph of order n with δ(g) δ. Let V δ ={v : d(v) = δ}. If there exists a vertex v V δ such that N(v) V δ =, then Now, we will prove our theorem. R(G) δ(n δ). Proof. We assume that G is a counterexample of minimal order for which R(G) is minimal. Since G is a triangle-free graph and δ(g),n 4. If δ(g) >, then, by Lemma, we have a triangle-free graph G of minimum degree at least and with R(G )<R(G)by deleting the maximal weight edge, a contradiction with the choice of G. Hence δ(g) =. Denote T ={v V (G) : d(v) = }. If there exists a vertex v T such that N(v) T =, then R(G) (n ) by Lemma 3, a contradiction with the choice of G. Thus we can assume that N(v) T for any v T. Choose a vertex u T such that N(u) T is as small as possible. Let N(u) ={u,u } with u l T and d(u ) = d. Claim. (N(u ) N(u )) {u}. Proof. Suppose that (N(u ) N(u ))\{u} =. Then n 5 and G = Gu+u u is no counterexample, R(G ) (n 3). Thus R(G) = R(G ) + d + d (n 3) + > (n ), which is a contradiction.
6 350 H. Liu et al. / On the Randić index By Claim and u T, we can assume that (N(u ) N(u )) ={u, v}. Denote d = d(v). Since G is a triangle-free graph, d + d n. Let S,S be the sums of the weights of the edges incident with v and u except for the edges u v, u v and uu,vu, respectively. Then S i d i di for i =,. Claim. v T. Proof. Suppose v/ T. Then by the choice of u, u / T. Thus d,d 3,n 6 and G = G u u is no counterexample, R(G ) (n 4). InG,if we denote S,S the sums of the weights of the edges incident with v and u except for the edge u v, respectively. Then S i = S i di /(d i ) for i =,. Since d + d n and d i 3,d i n 3fori =,. Then R(G) = R(G ) S + S d d d d (d )(d ) S d d S d d (n 4) d d d d ( ) ( ) (d )(d ) d d d d d d d d = (n 4) + + ( d ) d + ( d ) d ( + )( ) ( )( ). d d d d Using the same notation as in Lemma, we have R(G) (n 4) + + f(d,d ). Since 3 d,d n 3, we have f(d,d ) ( n 3 n 4) by Lemma. Thus R(G) (n 4) + + ( n 3 n 4) = (n ) + + ( n 3 n ) Since + ( n 3 n ) + ( ) >0 we have R(G) (n ), which is a contradiction.
7 H. Liu et al. / On the Randić index 35 Claim 3. u / T. Proof. Suppose u T.Ifn = 4, then R(G) = = (4 ), a contradiction with the choice of G. Therefore n 4. By G being a triangle-free graph and δ(g) =, we have n 8. So G = G u u u v is no counterexample. Thus which is a contradiction. R(G) = R(G ) + (n 6) + (n ), By Claims and 3, we have v T and d 3, Thus d n byg being triangle-free. Now, we will complete our proof by considering the following two cases. Case. d(u ) = d 4. In the case, n 6 and G = G u u v is no counterexample, and then R(G ) (n 5). Thus ( ) R(G) = R(G ) d d + + S d d d d (n 5) + + n n 4 (n 5) + + = + n 5 n n 4 (n 5) +. For n 6, + n 5 n n = 0, and hence R(G) (n ), which is a contradiction. Case. d(u ) = d = 3. Let N(u ) \{u, v} ={x}, d(x) = d and y N(x) \{u }.Ifd =, then (N(y) N(u ))\{x} = by d(u) = d(v) = and d = 3. Thus we can derive a contradiction by the same argument as the proof of Claim. Hence we can assume that d 3 and then n 8. Let S be the sum of the weights of the edges incident with x different from u x. Then S d d. Since G = G u u u v is no counterexample, R(G ) (n 6), wehave
8 35 H. Liu et al. / On the Randić index ( R(G) = R(G ) S 6 3d (n 6) d d d d ( ) d 3 (n 6) d ( 3 ) (n ) + (n 6) + (n ) ( 3 ). Since (n 6) ( ) (n ) > 0, we have R(G) > (n ), which is a contradiction. Hence the proof of our Theorem is completed. ) Appendix A Let G be the graph of Example and v 0 be any vertex of G with d(v 0 ) = δ(g). In the following, we will show that δ(n δ ) R(G v0 )>0. We have δ(n δ ) R(G v0 ) 3m(m ) (m + )(m ) = m(m ) m ( = (m ) 3m m + m(m ) m Since m > 0, it just needs to check that 3m m + m(m ) m Noting that 3m m(m ) m(m ) m(m ) m m(m ) m m(m ) m > m + (m )(m ) m + (m )(m ) (m )(m ) ) m. (m )(m ) m (m )(m ) > 0, m m(m ). 3m m > 3m m(m ) (m )(m ) m m m = m m > 0
9 H. Liu et al. / On the Randić index 353 and m + m + m > 0, m(m ) we will check that ( 3m m(m ) ) m ( m + > (m )(m ) m + m m(m ) ), 9m (m ) + (m ) (m )(m ) 6m(m ) (m ) m(m ) (m + ) > (m ) + m 4(m ) + m(m + ) (m ) m(m ), 5m 4 (m + ) (m ) (m ) m 4(m ) > m(4m 5) (m ) m(m ), 3m 3 7m + 45m 4 > 4(m )(4m 5) m(m ). Since m, 3m 3 7m + 45m 4 = (m )(m(3m 40) + 5) + > 0 and (m )(4m 5) m(m ) >0. Hence we just need to check that Note that (3m 3 7m + 45m 4) > ( 4(m )(4m 5) m(m )), 04m m m m m 360m + 6 > 6(m m)(64m 4 4m m 40m + 5), 64m 4 80m 3 39m + 40m + 6 > 0. 64m 4 80m 3 39m + 40m + 6 = m (8m 3)(8m + 3) + 40m + 6 > 0 by m, and hence δ(n δ ) R(G v 0 )>0 holds.
10 354 H. Liu et al. / On the Randić index Acknowledgments The first author is partially supported by the fund of Hubei University, second author is partially supported by NNSFC, and third author is partially supported by NNSFC (No 04300). References [] B. Bollobás and P. Erdös, Graphs of extremal weights, Ars Combin. 50 (998) 5. [] L.H. Clark and J.W. Moon, Ars Combinatorics 54 (999) 3. [3] C. Delorme, O. Favaron and D. Rautenbach, On the Randić index, Discrete Math. 57 (00) 9. [4] E. Estrada, Chem. Phys. Lett. 3 (999) 556. [5] E. Estrada, J. Chem. Inf. Comput. Sci. 35 (995) 0. [6] I. Gutman, D. Vidović and A. Nedić, J. Serb. Chem. Soc. in press. [7] I. Gutman and M. Leporić, J. Serb. Chem. Soc. 66 (00) 605. [8] I. Gutman and N. Trinajstić, Chem. Phys. Lett. 7 (97) 535. [9] L.B. Kier and L.H. Hall, Molecular Connectivity in Chemistry and Drug Research (Academic Press, San Francisco, 976). [0] L.B. Kier and L.H. Hall, Molecular Connectivity in Structure-Activity Analysis (Wiley, New york 986). [] M. Randić, On characterization of molecular branching, J. Amer. Chem. Soc. 97 (975) [] M. Randić, P.J. Hansen and P.C. Jurs, J. Chem. Inf. Comput. Sci. 8 (988) 60. [3] R. Todeschini and V. Consonni, Handbook of Molecular Descriptors (Wiley-VCH, Weinheim, 000).
Extremal trees with fixed degree sequence for atom-bond connectivity index
Filomat 26:4 2012), 683 688 DOI 10.2298/FIL1204683X Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal trees with fixed degree
More 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 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 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 informationThe Generalised Randić Index of Trees
The Generalised Randić Index of Trees Paul Balister Béla Bollobás Stefanie Gerke December 10, 2006 Abstract The Generalised Randić index R α (T ) of a tree T is the sum over the edges uv of T of (d(u)d(v))
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 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 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 informationTHE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER
Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic
More informationThe 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 informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 1 No. 2, 2016 pp.137-148 DOI: 10.22049/CCO.2016.13574 CCO Commun. Comb. Optim. On trees and the multiplicative sum Zagreb index Mehdi Eliasi and Ali
More 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 informationThe Generalised Randić Index of Trees
The Generalised Randić Index of Trees Paul Balister Béla Bollobás Stefanie Gerke January 18, 2007 Abstract The Generalised Randić index R α (T) of a tree T is the sum over the edges uv of T of (d(u)d(v))
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 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 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 informationRELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS
Kragujevac J. Sci. 30 (2008) 57-64. UDC 541.61 57 RELATION BETWEEN WIENER INDEX AND SPECTRAL RADIUS Slavko Radenković and Ivan Gutman Faculty of Science, P. O. Box 60, 34000 Kragujevac, Republic of Serbia
More informationA Survey on the Randić Index
A Survey on the Randić Index Xueliang Li and Yongtang Shi Center for Combinatorics and LPMC, Nankai University Tianjin 300071, P.R. China. Email: lxl@nankai.edu.cn (Received May 3, 007) Abstract The general
More informationDiscrete Applied Mathematics
iscrete Applied Mathematics 57 009 68 633 Contents lists available at Scienceirect iscrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On reciprocal complementary Wiener number Bo
More informationarxiv: v1 [math.co] 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 informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More 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 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 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 informationAn Ore-type Condition for Cyclability
Europ. J. Combinatorics (2001) 22, 953 960 doi:10.1006/eujc.2001.0517 Available online at http://www.idealibrary.com on An Ore-type Condition for Cyclability YAOJUN CHEN, YUNQING ZHANG AND KEMIN ZHANG
More informationSHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX R 1 OF A GRAPH
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 47, Number, 207 SHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX R OF A GRAPH EI MILOVANOVIĆ, PM BEKAKOS, MP BEKAKOS AND IŽ MILOVANOVIĆ ABSTRACT Let G be an undirected
More informationRelation Between Randić Index and Average Distance of Trees 1
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (011) 605-61 ISSN 0340-653 Relation Between Randić Index and Average Distance of Trees 1 Marek Cygan,
More informationOn the spectral radius of graphs with cut edges
Linear Algebra and its Applications 389 (2004) 139 145 www.elsevier.com/locate/laa On the spectral radius of graphs with cut edges Huiqing Liu a,meilu b,, Feng Tian a a Institute of Systems Science, Academy
More informationA note on balanced bipartitions
A note on balanced bipartitions Baogang Xu a,, Juan Yan a,b a School of Mathematics and Computer Science Nanjing Normal University, 1 Ninghai Road, Nanjing, 10097, China b College of Mathematics and System
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 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 Turán number of forests
On the Turán number of forests Bernard Lidický Hong Liu Cory Palmer April 13, 01 Abstract The Turán number of a graph H, ex(n, H, is the maximum number of edges in a graph on n vertices which does not
More informationSaturation numbers for Ramsey-minimal graphs
Saturation numbers for Ramsey-minimal graphs Martin Rolek and Zi-Xia Song Department of Mathematics University of Central Florida Orlando, FL 3816 August 17, 017 Abstract Given graphs H 1,..., H t, a graph
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 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 informationOn the higher randić indices of nanotubes
Journal of Computational Methods in Molecular Design, 205, 5 (3):0-5 Scholars Research Library (http://scholarsresearchlibrary.com/archive.html) On the higher randić indices of nanotubes Mohammad Reza
More informationGraphs with large maximum degree containing no odd cycles of a given length
Graphs with large maximum degree containing no odd cycles of a given length Paul Balister Béla Bollobás Oliver Riordan Richard H. Schelp October 7, 2002 Abstract Let us write f(n, ; C 2k+1 ) for the maximal
More informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
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 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 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 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 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 informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
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 informationMULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 21-29. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir MULTIPLICATIVE ZAGREB ECCENTRICITY
More informationExtremal 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 informationHamilton-Connected Indices of Graphs
Hamilton-Connected Indices of Graphs Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan and Mingquan Zhan Abstract Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald
More informationOn the Gutman index and minimum degree
On the Gutman index and minimum degree Jaya Percival Mazorodze 1 Department of Mathematics University of Zimbabwe, Harare, Zimbabwe mazorodzejaya@gmail.com Simon Mukwembi School of Mathematics, Statistics
More 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 informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More 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 informationand critical partial Latin squares.
Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares Rong Luo Department of Mathematical Sciences Middle Tennessee State University Murfreesboro, TN 37132, U.S.A luor@math.wvu.edu
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 informationMilovanović Bounds for Seidel Energy of a Graph
Advances in Theoretical and Applied Mathematics. ISSN 0973-4554 Volume 10, Number 1 (2016), pp. 37 44 Research India Publications http://www.ripublication.com/atam.htm Milovanović Bounds for Seidel Energy
More informationConnectivity indices of some famous dendrimers
Available online www.jocpr.com Journal of Chemical and Pharmaceutical Research, 2016, 8(8):229-235 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 Connectivity indices of some famous dendrimers Najmeh
More informationDiscrete Mathematics. The edge spectrum of the saturation number for small paths
Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for
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 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 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 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 informationBipartite graphs with at most six non-zero eigenvalues
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues
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 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 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 informationSolutions to Unsolved Problems on the Minimal Energies of Two Classes of Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 66 (2011) 943-958 ISSN 0340-6253 Solutions to Unsolved Problems on the Minimal Energies of Two Classes of
More informationSome 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 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 Atom-Bond Connectivity Index of Cacti
Filomat 8:8 (014), 1711 1717 DOI 10.98/FIL1408711D Publishe by Faculty of Sciences an Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Atom-Bon Connectivity Inex
More 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 informationCycles in 4-Connected Planar Graphs
Cycles in 4-Connected Planar Graphs Guantao Chen Department of Mathematics & Statistics Georgia State University Atlanta, GA 30303 matgcc@panther.gsu.edu Genghua Fan Institute of Systems Science Chinese
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationDomination and Total Domination Contraction Numbers of Graphs
Domination and Total Domination Contraction Numbers of Graphs Jia Huang Jun-Ming Xu Department of Mathematics University of Science and Technology of China Hefei, Anhui, 230026, China Abstract In this
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
More informationSet-orderedness as a generalization of k-orderedness and cyclability
Set-orderedness as a generalization of k-orderedness and cyclability Keishi Ishii Kenta Ozeki National Institute of Informatics, Tokyo 101-8430, Japan e-mail: ozeki@nii.ac.jp Kiyoshi Yoshimoto Department
More informationAALBORG UNIVERSITY. Total domination in partitioned graphs. Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo
AALBORG UNIVERSITY Total domination in partitioned graphs by Allan Frendrup, Preben Dahl Vestergaard and Anders Yeo R-2007-08 February 2007 Department of Mathematical Sciences Aalborg University Fredrik
More informationGraphs and Combinatorics
Graphs and Combinatorics (2005) 21:469 474 Digital Object Identifier (DOI) 10.1007/s00373-005-0625-0 Graphs and Combinatorics Springer-Verlag 2005 On Group Chromatic Number of Graphs Hong-Jian Lai 1 and
More informationarxiv: v1 [math.co] 12 Jul 2017
A SHARP DIRAC-ERDŐS TYPE BOUND FOR LARGE GRAPHS H.A. KIERSTEAD, A.V. KOSTOCHKA, AND A. McCONVEY arxiv:1707.03892v1 [math.co] 12 Jul 2017 Abstract. Let k 3 be an integer, h k (G) be the number of vertices
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 informationOn the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 30 2010 On the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices Xianya Geng Shuchao Li lscmath@mail.ccnu.edu.cn
More informationOn uniquely 3-colorable plane graphs without prescribed adjacent faces 1
arxiv:509.005v [math.co] 0 Sep 05 On uniquely -colorable plane graphs without prescribed adjacent faces Ze-peng LI School of Electronics Engineering and Computer Science Key Laboratory of High Confidence
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 informationHAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH
HAMILTONIAN CYCLES AVOIDING SETS OF EDGES IN A GRAPH MICHAEL J. FERRARA, MICHAEL S. JACOBSON UNIVERSITY OF COLORADO DENVER DENVER, CO 8017 ANGELA HARRIS UNIVERSITY OF WISCONSIN-WHITEWATER WHITEWATER, WI
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
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 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 informationThis article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial
More informationCOMPUTING SANSKRUTI INDEX OF DENDRIMER NANOSTARS. Chengdu University Chengdu, , P.R. CHINA 2 Department of Mathematics
International Journal of Pure and Applied Mathematics Volume 115 No. 2 2017, 399-404 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v115i2.16
More 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 informationHAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS FLORIAN PFENDER Abstract. Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3,,,,, ), i.e. T is a chain
More informationarxiv: v1 [cs.dm] 31 Mar 2013
The Total Irregularity of Graphs under Graph Operations arxiv:13040185v1 [csdm] 31 Mar 2013 April 2, 2013 Hosam Abdo, Darko Dimitrov Institut für Informatik, Freie Universität Berlin, Takustraße 9, D 14195
More 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 informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
More 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 informationOn sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs
On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs Saieed Akbari 1,2 Ebrahim Ghorbani 1,2 Jacobus H. Koolen 3,4 Mohammad Reza Oboudi 1,2 1 Department of Mathematical Sciences
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 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 information