Medical, Pharma, Engineering, Science, Technology and Business

**Nejati A ^{*} and Mehdi A**

Department of Mathematics, College of Basic Science, Karaj Branch, Islamic Azad University, Alborz, Iran

- *Corresponding Author:
- Nejati A

Department of Mathematics

College of Basic Science, Karaj Branch

Islamic Azad University, Alborz, Iran

**Tel:**+98 (261) 4418143-9

**E-mail:**[email protected]

**Received date:** April 01, 2014; **Accepted date:** July 04, 2014; **Published date:** July 08, 2014

**Citation:** Nejati A, Mehdi A (2014) On Reverse Eccentric Connectivity Index of One Tetragonal Carbon Nanocones. J Theor Comput Sci 1: 115. doi:10.4172/2376-130X.1000115

**Copyright:** © 2014 Nejati A, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

**Visit for more related articles at** Journal of Computer Science and Networking

Let be a molecular graph. The reverse eccentric connectivity index is defined as ( ) ( ) =RE c ( ) = ( ) u V G u REEC G G ecc u S ξ ∈ Σ , where ecc(u) is a largest distance between u and any other vertex v of molecular graph G and Su is the sum of the degrees of all vertices v, adjacent to** vertex **u. In this paper, an exact formula for the reverse **eccentric** connectivity index of one tetragonal carbon anocones was computed.

Eccentricity; Reverse eccentric connectivity index; Topological index

Research into carbon nanocones (CNC) started almost at the same time as the **discovery** of carbon nanotube (CNT) in 1991. In resent years, nanostructures involving carbon have been the focus of an intense research activity, which is driven to a large extent by the quest for new materials with specific applications. Ball studied the closure of (CNT) and mentioned that (CNT) could sealed by a conical cap, [1]. The official report of the discovery of isolated CNC was made in, 1994 when Ge and Sattler reported their observations of carbon cones mixed together with tubules an a flat graphite surface [2]. This are constructed from a graphene sheet by removing a 60º wedge and joining the edges produces a cone with a single pentagonal defect at the apex. If a 120º wedge is considered then a cone with a single square defect at the apex is obtained. the case of 240º wedges yields a single triangle defect at the apex [3-5].

**Topological** indices are graph invariants and are used for Quantitative Structure - Activity Relationship (QSPR) and Quantitative Structure - Property Relationship (QSPR) studies, [6-8]. Many topological indices have been defined and several of them have found applications as means to model physical, chemical, **pharmaceutical** and other properties of molecules.

A topological index of a molecular graph G is a** numeric quantity** related to G. The oldest nontrivial topological index is the Wiener index which was introduced by Harold Wiener. John Platt was the only person who immediately realized the importance of the Wiener’s pioneering work and wrote papers analyzing and interpreting the physical meaning of the Wiener index.

We now recall some algebraic definitions that will be used in the paper. Let G be a simple molecular graph without directed and multiple edges and without** loops**, the vertex and edge-sets of which are represented by V(G) and E(G), respectively. The vertices in G are connected by an edge if there exists an edge uv∈E(G) connecting the vertices u and v in G so that u,v∈V(G). In chemical graphs, the vertices of the graph correspond to the atoms of the molecule, and the edges represent the chemical bonds. The number of vertices and edges in a graph will be defined by |V (G)| and |E (G)| respectively. In graph theory, a path of length n in a graph is a sequence of n+1 vertices such that from each of its vertices there is an edge to the next vertex in the** sequence**. A vertex is external, if it lies on the boundary of the unbounded face of G, otherwise, the vertex is called internal.

The distance d_{G} (u,v) is defined as the length of the shortest path between u and v in G. D(u) denotes the sum of distances between u and all other vertices of G. For a given vertex u of V(G) its eccentricity, ecc (u), is the largest distance between u and any other vertex v of G. The maximum eccentricity over all vertices of G is called the diameter of G and denoted by Diam(G) and the minimum eccentricity among the vertices of G is called radius of G and denoted by R (G) and for any vertex u, Su is the sum of the degrees of its neighborhoods and degG (u) denotes the degree of the vertex u.

The Wiener index [9] is one of the most used topological indices with high correlation with many physical and chemical indices of molecular compounds. The Wiener index of a molecular graph G, denoted by W(G), is defined

The eccentric connectivity index of the molecular graph G, was proposed by Sharma. V and Gosvami [4]. It is defined as

The modified eccentric connectivity index (MEC) is defined as.

Recently, Ediz et al. [10] introduced a distance-based molecular structure descriptor, the reverse eccentric connectivity index defined as,

In this paper by using an algebraic method, we calculate the reverse eccentric connectivity index of one tetragonal carbon nanocones.

Let . Our notation is standard and mainly taken from standard books of graph theory and the books of Trinajestic and Kumar [11,12]. In this section, the reverse eccentric connectivity index of C[n] are calculated. To do this, the following lemmas are necessary.

**Lemma**

,

Proof. It is clear.

**Lemma**

,

**Proof .** Suppose u is a vertex of the central square of S . Then from **Figure 1** one can see that there exists a vertex v of degree 2 such that and so . On the other hand, there exists another vertex w of degree 2 such that . Therefore, the shortest path with maximum length is connecting two vertices of degree 2 in C[n]. This complete the proof.

The proof of Lemma 2.2, shows that the eccentricities of vertices of C[n] are varied between 2n+2 and 4n=2. Furthermore, we observe that there are two types of vertices in C[n]. 4n2 internal vertices of degree 3 have eccentricities between 2n+2 and 4n and 4n external vertices of degree 3 and 4n + 4 external vertices of degree 2 have eccentricities between 3n+2 and 4n+2.

Now we use an algebraic method for computing the eccentric connectivity of C[n]. For this purpose we consider two cases. The first case when n is an odd number and the second case when n is an even number. From **Figure 2** when n is an odd number, the external vertices of C[n] are made of types of vertices of degree 3 with eccentric connectivity equal to 3n + 2 + 2k and types of vertices of degree 2 with eccentric connectivity equal to 3n + 3+ 2k for But from **Figure 3** when n is an even number, the external vertices of C[n] is made of type vertices of degree 3 with eccentric connectivity equals to 3n + 3+ 2k for and type vertices of degree 2 with eccentric connectivity 3n + 2 + 2k for . Also, we observe that there are four types of vertex neighborhoods in C[n]. For all internal vertices, the product of their neighbors degrees is equal to 27. Then, there are 4n external vertices of degree 3 such that for all of them, the product of their neighbors degrees is equal to 12. There are exactly 8 external vertices of degree 2 such that their neighbors are of degrees 2 and 3 and for all of them, the product of their neighbors degrees is equal to 6. Finally, there are 4n-4 vertices of degree 2 such that both neighbors of them are of degree 3.

In the following theorem, the reverse eccentric connectivity index of C[n] is computed when n(≥ 1) is an odd number.

**Theorem: **The reverse eccentric connectivity index of C[n] is given by :

where n(≥ 1 ) is an odd number.

Proof. With respect to **Figure 2** where is a partition of the molecular graph C[n]. We have 4 types of vertices for every section of T_{i} . There are 8 vertices of type 1 with maximum eccentric connectivity 4n+2 and Su=5. Also there are 8(n-2l-2) vertices of type 2 when . The eccentric connectivity of 4(n − 2l − 2) vertices of them equals to 3n-2l and the eccentric connectivity of other vertices equals to 3n −1− 2l . For l ≤ k ≤ l +1, if k − l = 0 then we have 8 vertices with Su =7 and 8k vertices with Su = 9. Also if k − l =1 then we have 8 vertices with S_{u} = 6 and 8k vertices with S_{u} = 9 such that the eccentric connectivity of them is equals to 4n +1− k − l when . Also we have 4 vertices with Su = 7 and 4n-4 vertices with Su = 9 and ecc(u) = 3n + 2 and 4n vertices with S_{u} = 9 and ecc(u) = 3n +1. Thus we have

Now with a calculation in Matlab software we have

In the following theorem, the reverse eccentric connectivity index of C[n] is computed where n(≥ 2) is an even number.

Theorem: The reverse eccentric connectivity index of C[n] is given by :

where n(≥ 2) is an even number.

**Proof. **With respect to **Figure 3**, , where is a partition of the molecular graph C[n]. We have 4 types of vertices for every section of T_{i}. We have 4 vertices with Su=6 and 4n vertices with Su=9 of type 1 with mean eccentric connectivity 3n=2 and 8(n-2l-1) vertices () with S_{u}=9 of type 2, such that the eccentric connectivity of 4(n-2l-1) vertices of this type is equals to 3n +1− 2l and the eccentric connectivity of other vertices of this type is equals to 3n − 2l . For l ≤ k ≤ l +1, if k − l = 0 then we have 8l+8 vertices with Su=9 and 8 vertices with Su=6. Also if k − l =1 then we have 8l + 8 vertices with S_{u}=9 and 8 vertices with S_{u}=7 ecc(u) = 4n −l − k when . Also we ave 8 number of vertices with Su=5 and ecc(u) = 4n + 2 and 8 vertices with Su=7 and ecc(u) = 4n +1. Thus it implies that :

Now with a calculation in Matlab software we have

- Ball P (1991) Needles in a carbon haystack, Nature 354: 18.
- Ge M,Sattler K (1994) Observation of fullerene cones.Chem Phys Lett 220: 192-196.
- Park N, Yoon M, Berger S, Ihm J, Osawa E, et al. (2003) Magnetism in all carbon nanostructures with negative gussian curvature. Phy Rev Lett 91: 237204.
- Sharma V, Gosvami R, Madan AK (1997) Eccentric connectivity index: a novel highly discriminating topological descriptor for structure - property and structure - activity studies. J Chem Inf Model 37: 273-282.
- Nelson DR, Peliti L (1987) Fluctuations in membianes with crystalline and hexatic order. Phys. (Paris)48: 1085-1092.
- Balaban AT (1991) Topological indices and Related discriptors in QSAR and QSPR, Gordon and Breach Science Publishers,The Netherlands.
- Diudea MV, Stefu M, Park B, John PE (2004) Wiener index of armchair polyhex nanotubes. croat. Chem Acta77: 111.
- John PE, Diudea MV (2004) Wiener index of zig-zag polyhex nanotupes. Croat Chem Acta 77: 127-132.
- Wiener H (1947) Structural determination of paraffin boiling points. J Am Chem Soc69:17-20.
- Ediz S (2012) Reverse eccentric connectivity index. Optoelectron Adv Mater Rapid Comm6: 664-667.
- Trinajstic N(1992) Chemical Graph Theory. CRC Press, Boca Raton, FL.
- Kumar V,Modan AK (1991) Apllication of graph theory: Models for prediction of carbonic anhydrase inhibitory activity of sulfonamides.J Math Chem42: 925-940.

Select your language of interest to view the total content in your interested language

- Adomian Decomposition Method
- Advances in Health Care Technology
- Applications of Bioinformatics
- Applied Mathematics
- Applied Medical Informatics
- Balance Law
- Bioinformatics Algorithms
- Bioinformatics Databases
- Bioinformatics Tools
- Biomedical Informatics
- Cancer Informatics
- Cancer Proteomics
- Clinical Informatics
- Clinical Proteomics
- Computational Chemistry
- Computational Model
- Consolidated Health Informatics
- Consumer Health Informatics
- Convection Diffusion Equations
- Current Proteomics
- Dental Informatics
- Differential Transform Method
- Experimental Physics
- Fuzzy Boundary Value
- Fuzzy Environments
- Fuzzy Quasi-Metric Space
- Health Care Informatics
- Health Care Records
- Health Information Management
- Hospital Informatics/ Pharmacy Informatics
- Human Proteome Project Applications
- Integrated Analysis
- Mass Spectrometry in Proteomics
- Mathematics for Computer Science
- Mental Health Informatics
- Methods in Medical Informatics
- Microarray Proteomics
- Mixed Initial-boundary Value
- Models of Science
- Molecular Modelling
- Molecular and Cellular Proteomics
- Nonlinear Differential Equations
- Number Theory
- Numerical Solutions
- Physics Models
- Protein Sequence Analysis
- Proteome Profiling
- Proteomic Analysis
- Proteomic Biomarkers
- Proteomics Clinical Applications
- Proteomics Research
- Proteomics Science
- Python for Bioinformatics
- Quantitative Proteomics
- Quasilinear Hyperbolic Systems
- Scientific Computing
- Semi Analytical-Solution
- Sensitivity Analysis
- Simulation Computer Science
- Smooth Complexities
- Technologies in Computer Science
- Theoretical Chemistry
- Theoretical Computer Science
- Theoretical Issues in Ergonomics Science
- Theoretical Methods
- Theoretical and Applied Science
- Three Dimensional Steady State

- European Conference on
**Computer Science**&**Engineering**

June 20-21, 2018 Oslo, Norway - International Conference on
**Big Data**, Knowledge Discovery and**Data Mining**

August 06-07, 2018 Abu Dhabi, UAE - International Conference on
**Artificial Intelligence**,**Robotics**& IoT

August 21-22, 2018 Paris, France - International Conference on
**Computational Biology**and**Bioinformatics**

Sep 05-06 2018 Tokyo, Japan - International Conference on Advancements in
**Bioinformatics**and**Drug Discovery**

November 26-27, 2018 Dublin, Ireland

- Total views:
**11789** - [From(publication date):

September-2014 - Apr 26, 2018] - Breakdown by view type
- HTML page views :
**7985** - PDF downloads :
**3804**

Peer Reviewed Journals

International Conferences
2018-19