COMPUTING FIRST AND SECOND ZAGREB INDEX, FIRST AND SECOND ZAGREB POLYNOMIAL OF CAPRA- DESIGNED PLANAR BENZENOID SERIES Ca n (C 6 )

Similar documents
Bounds for the Connective Eccentric Index

Double Dominating Energy of Some Graphs

On Eccentricity Sum Eigenvalue and Eccentricity Sum Energy of a Graph

THE TRUNCATED RANDIĆ-TYPE INDICES

Topological Indices of Hypercubes

The Topological Indices of some Dendrimer Graphs

Fourth Zagreb index of Circumcoronene series of Benzenoid

Entropy ISSN by MDPI

Lower Bounds of the Kirchhoff and Degree Kirchhoff Indices

THE GENERALIZED ZAGREB INDEX OF CAPRA-DESIGNED PLANAR BENZENOID SERIES Ca k (C 6 )

Generalization of the Dissimilarity Measure of Fuzzy Sets

arxiv: v4 [math.nt] 14 Aug 2015

The Mathematical Appendix

On Submanifolds of an Almost r-paracontact Riemannian Manifold Endowed with a Quarter Symmetric Metric Connection

Research Article A New Iterative Method for Common Fixed Points of a Finite Family of Nonexpansive Mappings

International Journal of Mathematical Archive-5(8), 2014, Available online through ISSN

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

Non-uniform Turán-type problems

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables

Carbonyl Groups. University of Chemical Technology, Beijing , PR China;

Lebesgue Measure of Generalized Cantor Set

Arithmetic Mean and Geometric Mean

1 Edge Magic Labeling for Special Class of Graphs

Comparing Different Estimators of three Parameters for Transmuted Weibull Distribution

THE PROBABILISTIC STABILITY FOR THE GAMMA FUNCTIONAL EQUATION

F. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties

COMPROMISE HYPERSPHERE FOR STOCHASTIC DOMINANCE MODEL

PROJECTION PROBLEM FOR REGULAR POLYGONS

ON THE LOGARITHMIC INTEGRAL

Application of Generating Functions to the Theory of Success Runs

h-analogue of Fibonacci Numbers

Bivariate Vieta-Fibonacci and Bivariate Vieta-Lucas Polynomials

02/15/04 INTERESTING FINITE AND INFINITE PRODUCTS FROM SIMPLE ALGEBRAIC IDENTITIES

Council for Innovative Research

Third handout: On the Gini Index

A Study on Generalized Generalized Quasi hyperbolic Kac Moody algebra QHGGH of rank 10

Cubic Nonpolynomial Spline Approach to the Solution of a Second Order Two-Point Boundary Value Problem

Analysis of Lagrange Interpolation Formula

Transforms that are commonly used are separable

Further Results on Pair Sum Labeling of Trees

The Primitive Idempotents in

Abstract. 1. Introduction

L5 Polynomial / Spline Curves

EQUIENERGETIC COMPLEMENT GRAPHS

Isomorphism on Intuitionistic Fuzzy Directed Hypergraphs

On the construction of symmetric nonnegative matrix with prescribed Ritz values

MAX-MIN AND MIN-MAX VALUES OF VARIOUS MEASURES OF FUZZY DIVERGENCE

Lecture 1. (Part II) The number of ways of partitioning n distinct objects into k distinct groups containing n 1,

ANALYSIS ON THE NATURE OF THE BASIC EQUATIONS IN SYNERGETIC INTER-REPRESENTATION NETWORK

WIENER AND DETOUR INDICES OF A NEW TYPE OF NANOSTAR DENDRIMERS

A New Method for Decision Making Based on Soft Matrix Theory

#A27 INTEGERS 13 (2013) SOME WEIGHTED SUMS OF PRODUCTS OF LUCAS SEQUENCES

PTAS for Bin-Packing

Application of Legendre Bernstein basis transformations to degree elevation and degree reduction

Fibonacci Identities as Binomial Sums

MATH 247/Winter Notes on the adjoint and on normal operators.

TWO TYPES OF CONNECTIVITY INDICES OF THE LINEAR PARALLELOGRAM BENZENOID

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

E be a set of parameters. A pair FE, is called a soft. A and GB, over X is the soft set HC,, and GB, over X is the soft set HC,, where.

Bezier curve and its application

Strong Convergence of Weighted Averaged Approximants of Asymptotically Nonexpansive Mappings in Banach Spaces without Uniform Convexity

n -dimensional vectors follow naturally from the one

New Upper Bounds on A(n,d)

Exercises for Square-Congruence Modulo n ver 11

Mu Sequences/Series Solutions National Convention 2014

Chapter 9 Jordan Block Matrices

Derivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations

A Remark on the Uniform Convergence of Some Sequences of Functions

On Face Bimagic Labeling of Graphs

Q-analogue of a Linear Transformation Preserving Log-concavity

CS5620 Intro to Computer Graphics

Introduction to local (nonparametric) density estimation. methods

Square Difference Labeling Of Some Path, Fan and Gear Graphs

Extend the Borel-Cantelli Lemma to Sequences of. Non-Independent Random Variables

Lecture 12 APPROXIMATION OF FIRST ORDER DERIVATIVES

Some Notes on the Probability Space of Statistical Surveys

Research Article. Generalized Zagreb index of V-phenylenic nanotubes and nanotori

A BASIS OF THE GROUP OF PRIMITIVE ALMOST PYTHAGOREAN TRIPLES

A new Family of Distributions Using the pdf of the. rth Order Statistic from Independent Non- Identically Distributed Random Variables

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

2. Independence and Bernoulli Trials

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

THE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i

Research Article Gauss-Lobatto Formulae and Extremal Problems

arxiv: v2 [math.ag] 9 Jun 2015

The Lie Algebra of Smooth Sections of a T-bundle

On Signed Product Cordial Labeling

BERNSTEIN COLLOCATION METHOD FOR SOLVING NONLINEAR DIFFERENTIAL EQUATIONS. Aysegul Akyuz Dascioglu and Nese Isler

On the Interval Zoro Symmetric Single Step. Procedure IZSS1-5D for the Simultaneous. Bounding of Real Polynomial Zeros

MA 524 Homework 6 Solutions

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Minimum Hyper-Wiener Index of Molecular Graph and Some Results on Szeged Related Index

Investigating Cellular Automata

Decomposition of Hadamard Matrices

Deduction of Fuzzy Autocatalytic Set to Omega Algebra and Transformation Semigroup

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

Beam Warming Second-Order Upwind Method

1 Onto functions and bijections Applications to Counting

18.413: Error Correcting Codes Lab March 2, Lecture 8

Packing of graphs with small product of sizes

Transcription:

(RECOMMENDED CITATION) COMPUTING FIRST AND SECOND ZAGREB INDEX, FIRST AND SECOND ZAGREB POLYNOMIAL OF CAPRA- DESIGNED PLANAR BENZENOID SERIES Ca (C 6 ) MOHAMMAD REZA FARAHANI a, MIRANDA PETRONELLA VLAD b ABSTRACT. I graph theory, arous polyomals ad topologcal dces are ow, as arats uder graph automorphsm. I ths paper, we focus o the structure of Capra-desged plaar bezeod seres Ca (C 6 ), 0 ad compute o t seeral topologcal dces ad polyomals: frst ad secod Zagreb polyomals ad ther correspodg dces. Keywords: Capra Operato, bezeod seres, Frst Zagreb dex, secod Zagreb dex, Frst Zagreb polyomal, secod Zagreb polyomal. INTRODUCTION Let G=(V,E) be a molecular graph wth the ertex set V(G) ad the edge set E(G). V (G) =, E(G) =e are the umber of ertces ad edges. A molecular graph s a smple fte graph such that ts ertces correspod to the atoms ad the edges to the chemcal bods. The dstace d(u,) the graph G s the umber of edges a shortest path betwee two ertces u ad. The umber of ertex pars at ut dstace equals the umber of edges. A topologcal dex of a graph s a umber related to that graph ad s arat uder graph automorphsm. Weer dex W(G) s the oldest topologcal dex [1-5], whch has foud may chemcal applcatos. It s defed as: W G u V G V G d u a Departmet of Mathematcs of Ira Uersty of Scece ad Techology, (IUST), Narma, Tehra 16844, Ira. Mr_Faraha@Mathdep.ust.ac.r b Dmtre Catemr Uersty, Bucharest, Faculty of Ecoomc Sceces, No 56 Teodor Mhal Street, 400591, Cluj Napoca, Romaa, mradap@yahoo.com

MOHAMMAD REZA FARAHANI, MIRANDA PETRONELLA VLAD Hyper-Weer dex s a more recetly troduced dstace-based molecular descrptor [6]: WW G d u d u W G d u 134 u V G V G u V G V G Deote by d(g,) the umber of ertex pars of G lyg at dstace to each other ad by d(g) the topologcal dameter (.e, the logest topologcal dstace G). The Weer ad hyper-weer dces of G ca be expressed as [7, 8]: d G W G d G d G W W G d G Other oldest graph arat s the Frst Zagreb dex, whch was formally troduced by Gutma ad Trajst [9, 10]. It s deoted by M 1 (G) ad s defed as the sum of squares of the ertex degrees: M G d d u d V G e u E G where d s the degree of ertex. Next, Gutma troduced the Secod Zagreb dex M 2 (G) as: M G d u d e u E G Some basc propertes of M 1 (G) ca be foud ref. [9]. For a surey o theory ad applcatos of Zagreb dces see ref. [10]. Related to the two aboe topologcal dces, we hae the frst Zagreb Polyomal M 1 (G,x) ad secod Zagreb Polyomal M 2 (G,x), respectely. They are defed as: d u d M G x x e u E G M G x x e u E G d u d There was a ast research cocerg Zagreb dces ad Weer dex wth ts modfcatos [6] ad relatos betwee Weer, hyper-weer ad Zagreb dces [9-26]. WHAT IT IS THE CAPRA OPERATION? A mappg s a ew drawg of a arbtrary plaar graph G o the plae. I graph theory, there are may dfferet mappgs (or drawg); oe of them s Capra operato. Ths method eables oe to buld a ew structure of a plaar graph G.

COMPUTING FIRST AND SECOND ZAGREB INDEX, Let G be a cyclc plaar graph. Capra map operato s acheed as follows: () sert two ertces o eery edge of G; () () add pedat ertces to the aboe serted oes ad coect the pedat ertces order (-1,+3) aroud the boudary of a face of G. By rug these steps for eery face/cycle of G, oe obtas the Capra-trasform of G Ca(G), see Fgure 1. Fgure 1. Examples of Capra operato o the square face (top row) ad mappg Capra of plaar hexago (bottom row). By teratg the Capra-operato o the hexago (.e. bezee graph C 6 ) ad ts Ca-trasforms, a bezeod seres (Fgures 2 ad 3) ca be desged. We wll use the Capra-desged bezee seres to calculate some coectty dces (see below). Ths method was troduced by M.V. Dudea ad used may papers [27-36]. Sce Capra of plaar bezeod seres has a ery remarable structure, we loze t. We deote Capra operato by Ca, ths paper, as orgally Dudea dd. Thus, Capra operato of arbtrary graph G s Ca(G), terato of Capra wll be deoted by CaCa(G) (or we deote Ca 2 (G)) (Fgures 2 ad 3). The bezee molecule s a usual molecule chemstry, physcs ad ao sceces. Ths molecule s ery useful to sythesze aromatc compouds. We use the Capra operato to geerate ew structures of molecular graph bezee seres. Theorem 1. Let Ca(C 6 ) be the frst member of Capra of bezeod seres. The, Hosoya polyomal of Ca(C 6 ) s equal to: H(Ca(C 6 ),x)=24+30x 1 +48x 2 +57x 3 +x54x 4 +45x 5 +30x 6 +12x 7 ad the Weer dex of Ca(C 6 ) s equal to 1002. 135

MOHAMMAD REZA FARAHANI, MIRANDA PETRONELLA VLAD Hosoya polyomal H(G) s equal to x d u It s easy to u V G V G see that Weer dex s obtaed from Hosoya polyomal as the frst derate, x=1. Fgure 2. The frst two graphs Ca(C 6 ) ad Ca 2 (C 6 ) from the Capra of plaar bezeod seres, together wth the molecular graph of bezee (deoted here Ca 0 (C 6 )) 136 Fgure 3. Graph Ca 3 (C 6 ) s the thrd member of Capra plaar bezeod seres.

COMPUTING FIRST AND SECOND ZAGREB INDEX, By these termologes, we hae the followg theorem: Theorem 2. Cosder the graph G=Ca (C 6 ) as the terate Capra of plaar bezeod seres. The: Frst Zagreb polyomal of G s equal to M 1 (Ca (C 6 ),x)=(3(7 )-2(3 )-3)x 6 +4(3 )x 5 +(3 +3)x 4 ad the Frst Zagreb dex s M 1 (Ca (C 6 ))=18(7 )+12(3 )-6. Secod Zagreb polyomal of G s equal to M 2 Ca (C 6 ),x)=(3(7 )-2(3 )-3)x 9 4(3 )x 6 (3 +3)x 4 ad the Secod Zagreb dex of G s M 2 (Ca (C 6 ))=27(7 )+10(3 )-15. RESULTS AND DISCUSSION Capra trasforms of a plaar bezeod seres s a famly of molecular graphs whch are geeralzatos of bezee molecule C 6. I other words, we cosder the base member of ths famly s the plaar bezee, deoted here Ca 0 (C 6 )=C 6 =bezee. It s easy to see that Ca (C 6 )=Ca(Ca -1 (C 6 )) (Fgures 2 ad 3) [27-36]. I addto, we eed the followg defto. Defto 3. [21] Let G be a molecular graph ad d s the degree of ertex V G We dde ertex set V(G) ad edge set E(G) of graph G to seeral parttos, as follow: V V G d ad E e u E G d du Obously, d such that M d V G ad Max d V G Now, we start to proof of the aboe theorem. Proof of Theorem 2. Let G=Ca (C 6 ) ( 0) be the Capra plaar bezeod seres. By costructo, the structure Ca (C 6 ) collects see tmes of structure Ca -1 (C 6 ) (we call "flower" the substructure Ca -1 (C 6 ) the graph Ca (C 6 )). Therefore, by smple ducto o, the ertex set of Ca (C 6 ) wll hae 7 V(Ca (C 6 )) -6(2 3-1 +1) members. Because, there are 3-1 +1 ad 3-1 commo ertces betwee see flowers Ca -1 (C 6 ) Ca (C 6 ), mared by full blac color the aboe fgures. Smlarly, the edge set E(Ca (C 6 )) hae 7 E(Ca (C 6 )) -6(2 3-1 +1) members. Sce, there are 3-1 ad 3-1 commo edges (full blac color these fgures). 137

MOHAMMAD REZA FARAHANI, MIRANDA PETRONELLA VLAD Now, we sole the recurse sequeces V(Ca (C 6 )) ad E(Ca (C 6 )). Frst, suppose = V(Ca (C 6 )) ad e = E(Ca (C 6 )) so ad e e Thus, we hae j j j (1) where 0 =6 s the umber of ertces bezee C 6 (Fgure 2) ad s equal to O the other had, sce Hece (2) 138

COMPUTING FIRST AND SECOND ZAGREB INDEX, Therefore, by usg equatos (1) ad (2), we hae ad = V(Ca (C 6 )) =2 7 +3 +1 +1. By usg a smlar argumet ad (1), we ca see that e e e e e It s easy to see that, the frst member of recurse sequece e s e 0 =6, (Fgure 2). Now, by usg (2), we hae e ad the sze of edge set E(Ca (C 6 )) s equal to: e = E(Ca (C 6 )) =3(7 +3 ), Also, accordg to Fgures 2 ad 3, we see that the umber of ertces of degree two the graph Ca (C 6 ) (we deote by ) s equal to. The sx remoed ertces are the commo oes betwee the sx flowers "Ca -1 (C 6 )" wth degree three. By usg a smlar argumet ad smple ducto, we hae the umbers of edges of graph Ca (C 6 ), whch are the set E or E (deoted by Now, we sole the recurse sequece coclude Thus, e ). ad we It s obous that, accordg to the structure of bezee,. 1 3 3 Also, e E E 3 3 ad accordg to the aboe defto, t s obous that, for Capra of plaar bezeod seres G=Ca (C 6 ) we hae two parttos: V V Ca C d ad V V Ca C d wth the sze ad respectely. 139

MOHAMMAD REZA FARAHANI, MIRANDA PETRONELLA VLAD O the other had, accordg to the structure of Capra plaar bezeod seres Ca (C 6 ), there are edges, such that the frst pot of them s a ertex wth degree two. Amog these edges, there exst edges, of whch the frst ad ed pot of them hae degree 2 (the members of E or E ). Thus, e E E e. So, the sze of edge set E ad E s equal to e Now, t s obous that: e E E e e 1 3 7 2 3 1 Now, we ow the sze of all sets V V E E E E E ad E So, we ca calculate the Frst ad Secod Zagreb Polyomal of Capra plaar bezeod seres G=Ca (C 6 ), as follow: Frst Zagreb Polyomal of G=Ca (C 6 ): M G x x e E G d u d x x x e E e E e E E x E x E x x x x Secod Zagreb Polyomal of G Ca C : d u d M G x x x x x e E G e E e E e E x x x hae: M G Also, accordg to defto of Frst ad Secod Zagreb dex, we M G x x x 140

COMPUTING FIRST AND SECOND ZAGREB INDEX, ad M G M G x x x Of course, by usg V 2 ad V 3, we hae M G Thus, we completed the proof of the theorem 3. ACKNOWLEDGMENTS The frst author s thaful to Dr. M. Alaeya ad Dr. A. Aghaja of Departmet of Mathematcs, Ira Uersty of Scece ad Techology (IUST) for ther precous support ad suggestos. REFERENCES 1. H. Weer. J. Am. Chem. Soc. 1947, 69, 17. 2. A.A. Dobry, R. Etrger ad I. Gutma. Acta Appl. Math. 2001, 66, 211. 3. D.E. Needham, I.C. We ad P.G. Seybold. J. Am. Chem. Soc. 1988, 110, 4186. 4. G. Rucer ad C. Rucer. J. Chem. If. Comput. Sc. 1999, 39, 788. 5. B. Zhou ad I. Gutma, Chemcal Physcs Letters. 2004, 394, 93. 6. I. Gutma, Ida J. Chem, 1997, 36, 128. 7. D.J. Kle, I. Luots ad I. Gutma. J. Chem. If. Comput. Sc. 1995, 35, 50. 8. B. Zhou ad I. Gutma, Chemcal Physcs Letters. 2004, 394, 93. 9. I. Gutma ad N. Trajst, Chem. Phys. Lett. 1972, 17, 535. 10. I. Gutma, B. Ruscc, N. Trajst ad C.F. Wlcox, J. Chem. Phys. 1975, 62, 3399. 11. I. Gutma ad K.C. Das, MATCH Commu. Math. Comput. Chem. 2004, 50, 83. 12. S. Nolc, G. Koacec, A. Mlcec ad N. Trajst, Croat. Chem. Acta. 2003, 76, 113. 13. A. Behtoe, M. Jaesar ad B. Taer, Appl. Math. Lett. 2009, 22, 1571. 14. K.C. Das, I. Gutma ad B. Zhou, Joural of Mathematcal Chemstry. 2009, 46, 514. 15. M.H. Khalfeh, H. Yousef-Azar ad A.R. Ashraf, Comput. Appl. Math. 2008, 56, 1402. 16. S. L ad H. Zhou, Appl. Math. Lett. 2010, 22, 128. 17. M. Lu ad B. Lu, MATCH Commu. Math. Comput. Chem. 2010, 63, 151. 18. M. Ghorba ad M. Ghaz, Dgest. J. Naomater. Bos. 2010, 5(4), 1107. 19. M. Ghorba ad M. Ghaz, Dgest. J. Naomater. Bos. 2010, 5(4), 837. 141

MOHAMMAD REZA FARAHANI, MIRANDA PETRONELLA VLAD 20. M.R. Faraha. It. J. Chem. Model. 2013, 5(4), Ipress. 21. M.R. Faraha. Acta Chm. Slo. 2012, 59, 22. M.R. Faraha. Ad. Mater. Corroso. 2012, 1, 57-60. 23. M.R. Faraha. It. J. Naosc. Naotech. 2012, Accepted for publsh. 24. M.R. Faraha. Ad. Mater. Corroso. 2013, 2, 16-19 25. M.R. Faraha. Chemcal Physcs Research Joural. 2013, I press. 26. M.R. Faraha. J. Chem. Acta. 2013, 2, 70-72. 27. M. Goldberg. Tohou Math. J. 1937, 43, 104. 28. A. Dress ad G. Brme, MATCH Commu. Math. Comput. Chem. 1996, 33, 87. 29. M.V. Dudea, J. Chem. If. Model, 2005, 45, 1002. 30. M.V. Dudea, M. tefu, P.E. Joh, ad A. Graoac, Croat. Chem. Acta, 2006, 79, 355. 31. M.R. Faraha ad M.P.Vlad. Studa UBB Chema. 2012, 57(4), 55-63. 32. M.R. Faraha. Ad. Mater. Corroso. 2012, 1, 61-64. 33. M.R. Faraha. J. Appled Math. & Ifo. 2013, 31(5-6), I press. 34. M.R. Faraha ad M.P.Vlad. Studa UBB Chema. 2013, 58(2), accepted. 35. M.R. Faraha. Polymers Research Joural. 2013, 7(3), I press. 36. M.R. Faraha. Chemcal Physcs Research Joural. 2013, I press. 142