On the Atom-Bond Connectivity Index of Cacti
|
|
- Joanna French
- 5 years ago
- Views:
Transcription
1 Filomat 8:8 (014), DOI 10.98/FIL D Publishe by Faculty of Sciences an Mathematics, University of Niš, Serbia Available at: On the Atom-Bon Connectivity Inex of Cacti Hawei Dong a, Xiaoxia Wu b a Department of Mathematics, Minjiang University, Fuzhou Fujian , China b School of Mathematics an Statistics, Minnan Normal University, Zhangzhou Fujian , China Abstract. The Atom-Bon Connectivity (ABC) inex of a connecte graph G is efine as ABC(G) = (u)+(v) uv E(G), where (u) is the egree of vertex u in G. A connecte graph G is calle a cactus if (u)(v) any two of its cycles have at most one common vertex. Denote by G 0 (n, r) the set of cacti with n vertices an r cycles an G 1 (n, p) the set of cacti with n vertices an p penent vertices. In this paper, we give sharp bouns of the ABC inex of cacti among G 0 (n, r) an G 1 (n, p) respectively, an characterize the corresponing extremal cacti. 1. Introuction Let G be a simple graph with vertex set V(G) an ege set E(G). For u V(G), the egree of u, enote by (u). The Atom-Bon Connectivity (ABC) inex of G is efine as [8] ABC(G) = uv E(G) (u) + (v). (1) (u)(v) The ABC inex was shown to be well correlate with the heats of formation of alkanes, an that it thus can serve for preicting their thermoynamic properties [8]. Various properties of the ABC inex have been establishe, see chemical literature [0][1]. In aition to this, Estraa [7] elaborate a novel quantum-theory-like justification for this topological inex, showing that it provies a moel for taking into account 1,-, 1,3-, an 1,4-interactions in the carbon-atom skeleton of saturate hyrocarbons, an that it can be use for rationalizing steric effects in such compouns. These results triggere a number of mathematical investigations of ABC inex [1]- [6], [9]- [17], []- [5]. 010 Mathematics Subject Classification. Primary 05C35 ; Seconary 05C07, 05C90 Keywors. Atom-Bon Connectivity inex, cactus, upper boun Receive: 8 July 013; Accepte: 0 July 014 Communicate by Francesco Belaro Research supporte by the Founation to the Eucational Committee of Fujian (JA166 an JA108), by the NSF of Fujian (01D140) an by the Scientific an Technological Startup Project of Minjiang University (No. YKQ1009). aress: onghawei@16.com (Hawei Dong)
2 H. Dong, X. Wu / Filomat 8:8 (014), Let G be a graph. The neighborhoo of a vertex u V(G) will be enote by N(u), (G) = max(u) u V(G)} an δ(g) = min(u) u V(G)}. The graph that arises from G by eleting the vertex u V(G) will be enote by G u. Similarly, the graph G + uv arises from G by aing an ege uv between two non-ajacent vertices u an v of G. A penent vertex of a graph is a vertex with egree 1. If all of blocks of G are either eges or cycles, i.e., any two of its cycles have at most one common vertex, then G is calle a cactus. We use G 0 (n, r) to enote the set of cacti with n vertices an r cycles an G 1 (n, p) to enote the set of cacti with n vertices an p penent vertices. Obviously, G 0 (n, 0) are trees, G 0 (n, 1) are unicyclic graphs an G 1 (n, n 1) is star. The star with n vertices, enote by S n, is the tree with n 1 penent vertices. Let G(n, r) enote the cactus obtaine by aing r inepenent eges to the star S n (See Fig.1 (a)). Obviously, G(n, r) is a cactus with n vertices, r cycle, an n r 1 penent vertices. Note that G(n, r) G 0 (n, r) an G(n, r) G 1 (n, n r 1). G (n, p) enotes the cactus obtaine by aing (n p 1)/ inepenent eges to the star S n if n p is o an by aing (n p )/ inepenent eges to the start S an then inserting a egree -vertex in one of those inepenent eges if n p is even (See Fig.1(b)). Obviously, G (n, p) G 1 (n, p) an G (n, p) G(n, (n p 1)/) when n p is o. r n - p - n-r-1 G(n,r) p G (n,p) ( a ) ( b) Figure 1: G(n, r) an G (n, p) for n p is even It is straightforwar to compute ABC(G(n, r)) = 3r n + (n r 1) n 1, ABC(G (n, p)) = 3(n p 1) 3(n p ) n n + 1 i f n p is o, i f n p is even. For connectivity inex of cacti, Lu et al.[19] gave the sharp lower boun on the Ranić inex of cacti; Lin an Luo [18] gave the sharp lower boun of the Ranić inex of cacti with fixe penant vertices. In this paper, we use the techniques in [19] an [18] to give sharp upper bouns on ABC inex of cacti among G 0 (n, r) an cacti among G 1 (n, r), an characterize the corresponing extremal graphs, respectively. x+y For x, y 1, let h(x, y) = xy. Obviously, h(x, y) = h(y, x). This lemma will be useful in the following sections.
3 H. Dong, X. Wu / Filomat 8:8 (014), Lemma 1.1. [] h(x, 1) = x 1 x is strictly increasing with x, h(x, ) = x+y an h(x, y) = xy is strictly ecreasing with x for fixe y 3.. The Maximum ABC Inex of Ccacti with r Cycles In this section, we will stuy the sharp upper boun on ABC inex of cacti with n vertices an r cycles. Obviously, G 0 (n, 0) are trees with n vertices. Furtula et al [] prove that the star tree, S n, has the maximal ABC value among all trees with n( ) vertices. Lemma.1. [9] Let G G 0 (n, 0) an n, then ABC(G) () S n. n with equation if an only if G G(n, 0) Obviously, G 0 (n, 1) are unicyclic graphs. Xing et al [4] gave the upper boun for ABC inex of unicyclic graphs an characterize extremal graph. Lemma.. [3] Let G G 0 (n, 1) an n 3, then ABC(G) (n 3) G G(n, 1). n + 3 with equation if an only if Theorem.3. Let G G 0 (n, r), n 5. Then ABC(G) F(n, r) with equality if an only if G G(n, r), where F(n, r) = 3r n + (n r 1). Proof. By inuction on n + r. If r = 0 or r = 1, then the theorem hols clearly by Lemma.1 an.. Now, we assume that r, an n 5. If n = 5, then the theorem hols clearly by the facts that there is only one graph G(5, ) in G 0 (5, ) (see Fig. 1). Let G G 0 (n, r), n 6 an r. We consier the following two cases. Case 1. δ(g) = 1. Let u V(G) with (u) = 1 an uv E(G). Denote (v) = an N(v)\u} = x 1, x,, x 1 }. Then n 1. Assume, without loss of generality, that (x 1 ) = (x ) = = (x k 1 ) = 1 an (x i ) for k i 1, where k 1. Set G = G u x 1 x x k 1, then G G 0 (n k, r). By inuction assumption an Lemma 1.1, we have ABC(G) = ABC(G ) + k ABC(G ) + k [h(, (x i )) h( k, (x i ))] + 1 (by Lemma 1.1) F(n k, r) + k (by inuctive assumption) n = F(n, r) (n r 1) + (n r 1 k) n k n k 1 + k n k = F(n, r) + (n r 1 k)( n k 1 n ) + k( 1 F(n, r). (by Lemma 1.1) 1 n ) The equality ABC(G) = F(n, r) hols if an only if equalities hol throughout the above inequalities, that is, if an only if = n 1, r = n k 1 an G G(n k, r). Thus we have ABC(G) = F(n, r) hols if an only if G G(n, r).
4 Case. δ(g). H. Dong, X. Wu / Filomat 8:8 (014), By the efinition of cactus an δ(g), there exist two eges u 0 u 1, u 0 u E(G) such that (u 0 ) = (u 1 ) = an (u ) = 3. We will finish the proof by consiering two subcases. Subcase 1. u 1 u E(G). Let G G u 0 + u 1 u. Then G G 0 (n 1, r). By inuction assumption an Lemma 1.1, we have ABC(G) = ABC(G ) + 1 F(n 1, r) + 1 (by inuctive assumption) = F(n, r) + 1 n (n r 1) + (n r ) n = F(n, r) + [ 1 n ] + [(n r ) n (n r ) n ] < F(n, r). (by Lemma 1.1) Subcase. u 1 u E(G). Let N(u )\u 0, u 1 } = x 1, x,, x }. (x i ) for 1 i, since δ(g). Let G = G u 0 u 1. Then G G 0 (n, r 1). By inuctive assumption an Lemma 1.1, we have ABC(G) = ABC(G ) [h(, (x i )) h(, (x i ))] F(n, r 1) [h(, (x i )) h(, (x i ))] (by inuctive assumption) = F(n, r) 3 n (n r 1) + (n r 1) n [h(, (x i )) h(, (x i ))] n 4 = F(n, r) + (n r 1)[ n ] + [h(, (x i )) h(, (x i ))] F(n, r). (by Lemma 1.1) The equality ABC(G) = F(n, r) hols if an only if equalities hol throughout the above inequalities, that is, if an only if G G(n, r 1), r = an (x i ) = for i = 1,,. Thus we have ABC(G) = F(n, r) hols if an only if G G(n, r). 3. The Maximum ABC Inex of Cacti with p Penent Vertices In this section, we will stuy the sharp upper boun on ABC inex of cacti with n vertices an p penent vertices. Denote by S 1, the tree obtaine by attaching one penent vertex to a penent vertex of the star S. Lemma 3.1. [5] Let T be a tree with n 4 vertices an T S n, then ABC(T) (n 3) n + with equality hols if an only if T S 1,. Theorem 3.. Let G G 1 (n, p), n 4. n (1) If p = n 1, then ABC(G) = (n 1) an G S n. () If p = n, then ABC(G) + (n 3) n with equality if an only if G S 1,. (3) If p n 3, then ABC(G) f (n, p) with equality if an only if G G (n, p) where 3(n p 1) f (n, p) = n i f n p is o, 3(n p ) n + 1 i f n p is even.
5 Proof. H. Dong, X. Wu / Filomat 8:8 (014), (1) If p = n 1, then G S n. So, the result is obvious. () Since G has n penent vertices, it is a tree an n 4. By Lemma 3.1, S 1, is the unique graph with the maximum ABC inex among trees with n( 4) vertices an n penent vertices. This result follows. (3) By inuction on n. If n = 4 an p n 3, then n = 4 an p = 0, that is, G C 4. Since C 4 G (4, 0), the theorem hols clearly for n = 4. Now, we assume that n 5. Case 1. p 1. Let u V(G) with (u) = 1 an uv E(G). Denote (v) = an N(v)\u} = x 1, x,, x 1 }. Then n 1. Assume, without loss of generality, that (x 1 ) = (x ) = = (x k 1 ) = 1 an (x i ) for k i 1, where k 1. If (G) = n 1, then (v) = n 1 an each block of G is either a triangle or an ege by the efinition of cactus. It follows that G G(n, n p 1 ) an n p 1 is even. So, we assume that (G) n. Set G = G u x 1 x x k 1, then G G 1 (n k, p k). Note that n p an n k (p k) have the same parity. By inuction assumption an Lemma 1.1, we have = = ABC(G) = ABC(G ) + k ABC(G ) + k (p k) 1 + [h(, (x i )) h( k, (x i ))] (by Lemma 1.1) f (n k, p k) + k (by inuctive assumption) n n k f (n, p) p n k 1 + k 1, i f n p is o f (n, p) p n + (p k) n k 3 n k + k 1, i f n p is even n k f (n, p) + (p k)( n k 1 n ) + k( 1 n ), n k 3 f (n, p) + (p k)( n k n ) + k( 1 n ), f (n, p). (by Lemma 1.1) i f n p is o i f n p is even The equality ABC(G) = f (n, p) hols if an only if equalities hol throughout the above inequalities, that is, if an only if = n 1, p = k an G G (n k, p k). Thus we have ABC(G) = f (n, p) hols if an only if G G (n, p). Case. p = 0. By the efinition of cactus an p = 0, there exist two eges u 0 u 1, u 0 u E(G) such that (u 0 ) = (u 1 ) = an (u ) = 3. We will finish the proof by consiering two subcases. Subcase 1. u 1 u E(G). Let G G u 0 + u 1 u. Then G G 1 (n 1, 0).
6 H. Dong, X. Wu / Filomat 8:8 (014), If n is o, then f (n 1, 0) = 3() + 1 an f (n, 0) = 3(). Thus, by inuctive assumption, we have ABC(G) = ABC(G ) + 1 f (n 1, 0) + 1 = f (n, 0) 1 < f (n, 0). If n is even, then f (n 1, 0) = 3(n ) an f (n, 0) = 3(n ) ABC(G) = ABC(G ) + 1 f (n 1, 0) + 1 = f (n, 0) Thus, by inuctive assumption, we have The equality ABC(G ) = f (n 1, 0) hols if an only if G G (n 1, 0). Hence, ABC(G) = f (n, 0) hols if an only if G G (n, 0) for n is even. Subcase. u 1 u E(G). Let N(u )\u 0, u 1 } = x 1, x,, x }. (x i ) for 1 i, since δ(g). Let G = G u 0 u 1. Then G G 1 (n, 0). By inuctive assumption an Lemma 1.1, we have ABC(G) = ABC(G ) [h(, (x i )) h(, (x i ))] f (n, 0) [h(, (x i )) h(, (x i ))] = f (n, 0) [h(, (x i )) h(, (x i ))] f (n, 0). (by Lemma 1.1) (by inuctive assumption) The equality ABC(G) = f (n, 0) hols if an only if equalities hol throughout the above inequalities, that is, if an only if G G (n, 0) an (x i ) = for i = 1,,. Thus we have ABC(G) = f (n, 0) hols if an only if G G (n, 0). References [1] J. Chen, X. Guo, Extreme atom-bon connectivity inex of graphs, MATCH Communications in Mathematical an in Computer Chemistry 65(011) [] J. Chen, X. Guo, The atom-bon connectivity inex of chemical bicyclic graphs, Applie Mathematics 7 (01) [3] J. Chen, J. liu, Q. li, The Atom-Bon Connectivity Inex of Cataconense Polyomino Graphs, Discrete Dynamics in Nature an Society, 013(013) 1 7. [4] K. C. Das, Atom-bon connectivity inex of graphs, Discrete Applie Mathematics 158 (010) [5] K. C. Das, I. Gutman, B. Furtula, On atom-bon connectivity inex, Chemical Physics Letters 511 (011) [6] K. C. Das, N. Trinajstić, Comparison between first geometric-arithmetic inex an atom-bon connectivity inex, Chemical Physics Letters 497 (010) [7] E. Estraa, Atom-bon connectivity an the energetic of branche alkanes, Chemical Physics Letters 463 (008) [8] E. Estraa, L. Torres, L. Roríguez an I. Gutman, An atom -bon connectivity inex: Moelling the enthalpy of form ation of alkanes, Inian Journal of Chemistry 37A (1998) [9] B. Furtula, A. Graovac an D. Vuki ccević, Atom Cbon connectivity inex of trees, Discrete Applie Mathematics 157 (009) [10] L. Gan, H. Hou, B. Liu, Some results on atom-bon connectivity inex of graphs, MATCH Communications in Mathematical an in Computer Chemistry 66(011) [11] I Gutman, B Furtula, M Ivanovic, Notes on Trees with Minimal AtomCBon Connectivity Inex, MATCH Communications in Mathematical an in Computer Chemistry 67 (01) [1] I. Gutman, B. Furtula, Trees with Smallest Atom-Bon Connectivity Inex, MATCH Communications in Mathematical an in Computer Chemistry 68 (01) [13] B. Horolagva, I. Gutman, On some vertex-egree-base graph invariants, MATCH Communications in Mathematical an in Computer Chemistry 65(011) [14] X. Ke, Atom-bon connectivity inex of benzenoi systems an fluoranthene congeners, Polycyclic Aromatic Compouns 3 (01) [15] J. Li, B. Zhou, Atom-bon connectivity inex of unicyclic graphs with perfect matchings, Ars Combinatoria 109 (013) [16] W. Lin, X. Lin, T. Gao, X. Wu, Proving a conjecture of Gutman concerning trees with minimal ABC inex, MATCH Communications in Mathematical an in Computer Chemistry 69 (013) [17] W. Lin, T. Gao, Q, Chen, X. Lin, On The Minimal ABC Inex of Connecte Graphs with Given Degree Sequence, MATCH Communications in Mathematical an in Computer Chemistry 69 (013)
7 H. Dong, X. Wu / Filomat 8:8 (014), [18] A. Lin, R.Luo, X.Zha, A sharp lower of the Ranić inex of cacti with r penants, Discrete Applie Mathematics 156(008) [19] M. Lu, L.Zhang, F.Tian, On the Ranić inex of cacti, MATCH Communications in Mathematical an in Computer Chemistry 56(006) [0] R. Toeschini, V. Consonni, Hanbook of Molecular Descriptors, Wiley-VCH, Weinheim, 000. [1] R. Toeschini, V. Consonni, Molecular Descriptors for Chemoinformatics, Wiley-VCH, Weinheim, 009. [] R. Xing, B. Zhou an Z. Du, Further results on atom -bon connectivity inex of trees, Discrete Applie Mathematics 158 (010) [3] R. Xing, B. Zhou, Extremal trees with fixe egree sequence for atom-bon connectivity inex, Filomat 6 (01) [4] R. Xing, B. Zhou, F. Dong, On atom-bon connectivity inex of connecte graphs, Discrete Applie Mathematics 159 (011) [5] B. Zhou, R. Xing, On atom-bon connectivity inex, Zeitschrift für Naturforschung A 66 (011)
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 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 Wiener Index of Trees with Prescribed Diameter
011 1 15 4 ± Dec., 011 Operations Research Transactions Vol.15 No.4 The Wiener Inex of Trees with Prescribe Diameter XING Baohua 1 CAI Gaixiang 1 Abstract The Wiener inex W(G) of a graph G is efine as
More informationThe eccentric-distance sum of some graphs
Electronic Journal of Graph Theory an Applications 5 (1) (017), 51 6 The eccentric-istance sum of some graphs Pamapriya P., Veena Matha Department of Stuies in Mathematics University of Mysore, Manasagangotri
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 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 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 informationOn the harmonic index of the unicyclic and bicyclic graphs
On the harmonic index of the unicyclic and bicyclic graphs Yumei Hu Tianjin University Department of Mathematics Tianjin 30007 P. R. China huyumei@tju.edu.cn Xingyi Zhou Tianjin University Department of
More informationMULTIPLICATIVE ZAGREB ECCENTRICITY INDICES OF SOME COMPOSITE GRAPHS. Communicated by Ali Reza Ashrafi. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 3 No. 2 (2014), pp. 21-29. c 2014 University of Isfahan www.combinatorics.ir www.ui.ac.ir MULTIPLICATIVE ZAGREB ECCENTRICITY
More 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 informationarxiv: v1 [math.co] 17 Apr 2018
On extremal cacti with respect to the edge revised Szeged index arxiv:180.06009v1 [math.co] 17 Apr 2018 Shengjie He a, Rong-Xia Hao a, Deming Li b a Department of Mathematics, Beijing Jiaotong University,
More informationHKBU Institutional Repository
Hong Kong Baptist University HKBU Institutional Repository Department of Mathematics Journal Articles Department of Mathematics 2003 Extremal k*-cycle resonant hexagonal chains Wai Chee Shiu Hong Kong
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 informationRedefined Zagreb, Randic, Harmonic and GA Indices of Graphene
International Journal of Mathematical Analysis Vol. 11, 2017, no. 10, 493-502 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7454 Redefined Zagreb, Randic, Harmonic and GA Indices of Graphene
More informationA 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 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 informationThe Linear Chain as an Extremal Value of VDB Topological Indices of Polyomino Chains
Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5133-5143 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46507 The Linear Chain as an Extremal Value of VDB Topological Indices of
More informationarxiv: v1 [math.co] 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 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] 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 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 informationArticle On the Additively Weighted Harary Index of Some Composite Graphs
mathematics Article On the Aitively Weighte Harary Inex of Some Composite Graphs Behrooz Khosravi * an Elnaz Ramezani Department of Pure Mathematics, Faculty of Mathematics an Computer Science, Amirkabir
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 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 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 informationSome Lower and Upper Bounds on the Third ABC Co-index
Intenational JMath Combin Vol4(07), 84-90 Some Lowe an Uppe Bouns on the Thi BC Co-inex Deepak S Revanka, Piyanka S Hane, Satish P Hane 3 an Vijay Teli 3 Depatment of Mathematics, KLE, D M S S C E T, Belagavi
More informationCanadian Journal of Chemistry. On molecular topological properties of diamond like networks
anaian Journal of hemistry On molecular topological properties of iamon like networks Journal: anaian Journal of hemistry Manuscript I cjc-207-0206.r Manuscript Type: Article ate Submitte by the Author:
More informationSome properties of the first general Zagreb index
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 47 (2010), Pages 285 294 Some properties of the first general Zagreb index Muhuo Liu Bolian Liu School of Mathematic Science South China Normal University Guangzhou
More informationOn the 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 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 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 informationThe Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size
Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of
More informationOn Pathos Lict Subdivision of a Tree
International J.Math. Combin. Vol.4 (010), 100-107 On Pathos Lict Subivision of a Tree Keerthi G.Mirajkar an Iramma M.Kaakol (Department of Mathematics, Karnatak Arts College, Dharwa-580 001, Karnataka,
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 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 Average of the Eccentricities of a Graph
Filomat 32:4 (2018), 1395 1401 https://doi.org/10.2298/fil1804395d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Average
More 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 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 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 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 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 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 informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
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 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 informationA new proof of the sharpness of the phase transition for Bernoulli percolation on Z d
A new proof of the sharpness of the phase transition for Bernoulli percolation on Z Hugo Duminil-Copin an Vincent Tassion October 8, 205 Abstract We provie a new proof of the sharpness of the phase transition
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 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 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 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 informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
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 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 Geometric Arithmetic Index
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun Math Comput Chem 74 (05) 03-0 ISSN 0340-653 On the Geometric Arithmetic Index José M Rodríguez a, José M Sigarreta b a Departamento
More informationThree-Variable Bracket Polynomial for Two-Bridge Knots
Three-Variable Bracket Polynomial for Two-Brige Knots Matthew Overuin Research Experience for Unergrauates California State University, San Bernarino San Bernarino, CA 92407 August 23, 2013 Abstract In
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 informationKragujevac J. Sci. 33 (2011) UDC : ZAGREB POLYNOMIALS OF THORN GRAPHS. Shuxian Li
Kragujevac J. Sci. 33 (2011) 33 38. UDC 541.27:541.61 ZAGREB POLYNOMIALS OF THORN GRAPHS Shuxian Li Department of Mathematics, South China Normal University, Guangzhou 510631, China e-mail: lishx1002@126.com
More informationSOME RESULTS ON THE GEOMETRY OF MINKOWSKI PLANE. Bing Ye Wu
ARCHIVUM MATHEMATICUM (BRNO Tomus 46 (21, 177 184 SOME RESULTS ON THE GEOMETRY OF MINKOWSKI PLANE Bing Ye Wu Abstract. In this paper we stuy the geometry of Minkowski plane an obtain some results. We focus
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 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 informationThe Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl Hexagonal Chains
Iranian J. Math. Chem. 9 (4) December (2018) 241 254 Iranian Journal of Mathematical Chemistry Journal homepage: ijmc.kashanu.ac.ir The Extremal Graphs for (Sum-) Balaban Index of Spiro and Polyphenyl
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 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 informationPermanent vs. Determinant
Permanent vs. Determinant Frank Ban Introuction A major problem in theoretical computer science is the Permanent vs. Determinant problem. It asks: given an n by n matrix of ineterminates A = (a i,j ) an
More informationLower bounds for the Estrada index
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 48 2012 Lower bounds for the Estrada index Yilun Shang shylmath@hotmail.com Follow this and additional works at: http://repository.uwyo.edu/ela
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 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 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 informationDistance spectral radius of trees with fixed maximum degree
Electronic Journal of Linear Algebra Volume 20 Volume 20 (200) Article 3 200 Distance spectral radius of trees with fixed maximum degree Dragan Stevanovic Aleksandar Ilic aleksandari@gmail.com Follow this
More informationTHE EXPLICIT EXPRESSION OF THE DRAZIN INVERSE OF SUMS OF TWO MATRICES AND ITS APPLICATION
italian journal of pure an applie mathematics n 33 04 (45 6) 45 THE EXPLICIT EXPRESSION OF THE DRAZIN INVERSE OF SUMS OF TWO MATRICES AND ITS APPLICATION Xiaoji Liu Liang Xu College of Science Guangxi
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 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 informationMore on Zagreb Coindices of Composite Graphs
International Mathematical Forum, Vol. 7, 2012, no. 14, 669-673 More on Zagreb Coindices of Composite Graphs Maolin Wang and Hongbo Hua Faculty of Mathematics and Physics Huaiyin Institute of Technology
More informationTHE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS
Hacettepe Journal of Mathematics and Statistics Volume 1 01 559 566 THE REVISED EDGE SZEGED INDEX OF BRIDGE GRAPHS Hui Dong and Bo Zhou Received 01:09:011 : Accepted 15:11:011 e=uv EG Abstract The revised
More 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 informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationarxiv: v1 [math.co] 27 Nov 2014
Extremal matching energy of complements of trees Tingzeng Wu a,,1, Weigen Yan b,2, Heping Zhang c,1 a School of Mathematics and Statistics, Qinghai Nationalities University, Xining, Qinghai 810007, P.
More information2-bondage in graphs. Marcin Krzywkowski*
International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
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 informationAbout Atom Bond Connectivity and Geometric-Arithmetic Indices of Special Chemical Molecular and Nanotubes
Journal of Informatics and Mathematical Sciences Vol. 10, Nos. 1 & 2, pp. 153 160, 2018 ISSN 0975-5748 (online); 0974-875X (print) Published by RGN Publications http://dx.doi.org/10.26713/jims.v10i1-2.545
More 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 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 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 informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationOn the higher randić indices of nanotubes
Journal of Computational Methods in Molecular Design, 205, 5 (3):0-5 Scholars Research Library (http://scholarsresearchlibrary.com/archive.html) On the higher randić indices of nanotubes Mohammad Reza
More 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 informationExact Max 2-Sat: Easier and Faster
Exact Max -Sat: Easier an Faster Martin Fürer Shiva Prasa Kasiviswanathan Computer Science an Engineering, Pennsylvania State University e-mail: {furer,kasivisw}@cse.psu.eu Abstract Prior algorithms known
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 informationIMFM Institute of Mathematics, Physics and Mechanics Jadranska 19, 1000 Ljubljana, Slovenia. Preprint series Vol. 50 (2012), 1173 ISSN
IMFM Institute of Mathematics, Physics an Mechanics Jaransa 19, 1000 Ljubljana, Slovenia Preprint series Vol. 50 (2012), 1173 ISSN 2232-2094 PARITY INDEX OF BINARY WORDS AND POWERS OF PRIME WORDS Alesanar
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 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 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 informationLower Bounds for the Smoothed Number of Pareto optimal Solutions
Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.
More informationarxiv: v1 [math.co] 12 Jul 2011
On augmented eccentric connectivity index of graphs and trees arxiv:1107.7v1 [math.co] 1 Jul 011 Jelena Sedlar University of Split, Faculty of civil engeneering, architecture and geodesy, Matice hrvatske
More 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 informationSharp Thresholds. Zachary Hamaker. March 15, 2010
Sharp Threshols Zachary Hamaker March 15, 2010 Abstract The Kolmogorov Zero-One law states that for tail events on infinite-imensional probability spaces, the probability must be either zero or one. Behavior
More informationGLOBAL SOLUTIONS FOR 2D COUPLED BURGERS-COMPLEX-GINZBURG-LANDAU EQUATIONS
Electronic Journal of Differential Equations, Vol. 015 015), No. 99, pp. 1 14. ISSN: 107-6691. URL: http://eje.math.txstate.eu or http://eje.math.unt.eu ftp eje.math.txstate.eu GLOBAL SOLUTIONS FOR D COUPLED
More informationOn the distance spectral radius of unicyclic graphs with perfect matchings
Electronic Journal of Linear Algebra Volume 27 Article 254 2014 On the distance spectral radius of unicyclic graphs with perfect matchings Xiao Ling Zhang zhangxling04@aliyun.com Follow this and additional
More informationJOURNAL OF MATHEMATICAL NANOSCIENCE. Connective eccentric index of fullerenes
JOURNAL OF MATHEMATICAL NANOSCIENCE JMNS Vol 1, No 1, 2011, 43-50 Connective eccentric index of fullerenes MODJTABA GHORBANI Department of Mathematics, Faculty of Science, Shahid Rajaee Teacher Training
More information