<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">AM</journal-id><journal-title-group><journal-title>Applied Mathematics</journal-title></journal-title-group><issn pub-type="epub">2152-7385</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/am.2018.98061</article-id><article-id pub-id-type="publisher-id">AM-86650</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  On the ECI and CEI of Boron-Nitrogen Fullerenes
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Tingzeng</surname><given-names>Wu</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Ying</surname><given-names>Wu</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>School of Mathematics and Statistics, Qinghai Nationalities University, Xining, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>mathtzwu@163.com(TW)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>14</day><month>08</month><year>2018</year></pub-date><volume>09</volume><issue>08</issue><fpage>891</fpage><lpage>896</lpage><history><date date-type="received"><day>22,</day>	<month>July</month>	<year>2018</year></date><date date-type="rev-recd"><day>12,</day>	<month>August</month>	<year>2018</year>	</date><date date-type="accepted"><day>15,</day>	<month>August</month>	<year>2018</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  
    The eccentric connectivity index and connective eccentricity index are important topological indices for chemistry. In this paper, we investigate the eccentric connectivity index and connective eccentricity index of boron-nitrogen fullerenes, respectively. And we give computing formulas of eccentric connectivity index and connective eccentricity index of all boron-nitrogen fullerenes with regular structure. 
  
 
</p></abstract><kwd-group><kwd>Eccentric Connectivity Index</kwd><kwd> Connective Eccentricity Index</kwd><kwd> Boron-Nitrogen Fullerenes</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>All graphs considered in this paper are simple connected graphs. Let G be a graph with vertex set V ( G ) and edge set E ( G ) . Let v ∈ V ( G ) , d ( v ) denotes the degree of v. For vertices u , v ∈ V ( G ) , the distance d ( u , v ) is defined as the length of a shortest path between u and v in G. The eccentricity ε ( v ) of a vertex v is the maximum distance from v to any other vertex.</p><p>The chemical information derived through the topological index has been found useful in chemical documentation, isomer discrimination, structure-property correlations, etc. For quite some time there has been rising interest in the field of computational chemistry in topological indices. The interest in topological indices is mainly related to their use in nonempirical quantitative structure-property relationships and quantitative structure-activity relationships. Among various indices, the eccentric connectivity index and connective eccentricity index involving eccentricity have attracted much attention.</p><p>Sharma et al. [<xref ref-type="bibr" rid="scirp.86650-ref1">1</xref>] introduced a distance-based molecular structure descriptor, the eccentric connectivity index (ECI for short) defined as</p><p>ξ c ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) . (1)</p><p>The ECI was successfully used for mathematical models of biological activities of diverse nature, see [<xref ref-type="bibr" rid="scirp.86650-ref2">2</xref>] - [<xref ref-type="bibr" rid="scirp.86650-ref7">7</xref>] and the references cited therein.</p><p>A novel graph invariant for predicting biological and physical properties―connective eccentricity index (CEI briefly) was introduced by Gupta et al. [<xref ref-type="bibr" rid="scirp.86650-ref8">8</xref>] , which was defined as:</p><p>ξ c e ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) . (2)</p><p>Some recent results on the CEI of graphs can be found in [<xref ref-type="bibr" rid="scirp.86650-ref9">9</xref>] - [<xref ref-type="bibr" rid="scirp.86650-ref14">14</xref>] .</p><p>Boron-nitrogen fullerene is a member of the fullerene family, it has been extensively studied [<xref ref-type="bibr" rid="scirp.86650-ref15">15</xref>] [<xref ref-type="bibr" rid="scirp.86650-ref16">16</xref>] [<xref ref-type="bibr" rid="scirp.86650-ref17">17</xref>] . A boron-nitrogen fullerene is also called (4,6)-fullerene graph which is a plane cubic graph whose faces have sizes 4 and 6. Let G be a (4,6)-fullerene graph with n vertices. By Euler’s formula, G has exactly</p><p>six faces of size 4 and n 2 − 4 faces of size 6.</p><p>A (4,6)-fullerene graph is said to be of dispersive structure if has neither three squares arranged in a line nor a square-cap. According to the quadrilateral positional relationship, Wei and Zhang [<xref ref-type="bibr" rid="scirp.86650-ref18">18</xref>] given a classification of all (4,6)-fullerenes as follows.</p><p>Lemma 1 [<xref ref-type="bibr" rid="scirp.86650-ref18">18</xref>] Let G be a (4,6)-fullerene graph. Then G can be of one of the following five types:</p><p>1) a cube,</p><p>2) a hexagonal prism,</p><p>3) a tubular graph with at least one hexagon-layer,</p><p>4) a (4,6)-fullerene graph of lantern structure,</p><p>5) a (4,6)-fullerene graph of dispersive structure,</p><p>where the resulting graphs see <xref ref-type="fig" rid="fig1">Figure 1</xref>.</p><p>In this paper, we aim to investigate the ECI and CEI of a boron-nitrogen fullerene. In next section, we give computing formulas of ECI and CEI of a boron-nitrogen fullerene.</p></sec><sec id="s2"><title>2. Computing Formula of ECI and CEI of a (4,6)-Fullerene</title><p>In this section, according the classification of all boron-nitrogen fullerenes in Lemma 1, we will give computing formula of CEI of a (4,6)-fullerene.</p><p>Theorem 2 Let G be a (4,6)-fullerene graph. Then</p><p>1) ξ c e ( G ) = ( 8 if G isacube , 9 if G ishexagonalprism .</p><p>2) ξ c ( G ) = ( 72 if G isacube , 144 if G ishexagonalprism .</p><p>Proof. Let G be a cube. Checking the structure of G, we obtain that the eccentricity of every vertex in G is 3. By (1) and (2), we have</p><p>ξ c e ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) = ∑ v ∈ V ( G ) 3 3 = 8 , (3)</p><p>and</p><p>ξ c ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) = ∑ v ∈ V ( G ) 3 &#215; 3 = 72. (4)</p><p>Similarly, let G be a hexagonal prism. Checking the structure of G, we obtain that the eccentricity of every vertex in G is 4. By (1) and (2), we obtain</p><p>ξ c e ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) = ∑ v ∈ V ( G ) 3 4 = 9 , (5)</p><p>and</p><p>ξ c ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) = ∑ v ∈ V ( G ) 3 &#215; 4 = 144. (6)</p><p>Theorem 3 Let G be a tubular graph, and let the number of hexagon-layer in G be k ≥ 1 . Then</p><p>ξ c e ( G ) = 18 ∑ i = 3 k + 4 1 k + i + 6 2 k + 5 ; (7)</p><p>ξ c ( G ) = 27 k 2 + 129 k + 156. (8)</p><p>Proof. Let v be a vertex of G. By the structure of G (see <xref ref-type="fig" rid="fig1">Figure 1</xref>), we know that the eccentricity of v equal to the distance between v and u (or u’). Thus, the eccentricity sequence of G is ( 2 k + 5,2 k + 5 ︷ 2 , 2 k + 4, ⋯ ,2 k + 4 ︷ 6 , 2 k + 3, ⋯ ,2 k + 3 ︷ 6 , ⋯ , k + 4, ⋯ , k + 4 ︷ 6 , k + 3, ⋯ , k + 3 ︷ 6 ). By (1) and (2), we obtain</p><p>ξ c e ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) (9)</p><p>= 3 [ ( 1 2 k + 4 + 1 2 k + 3 + ⋯ + 1 k + 3 ) &#215; 6 + 1 2 k + 5 &#215; 2 ] (10)</p><p>= 18 ∑ i = 3 k + 4 1 k + i + 6 2 k + 5 . (11)</p><p>and</p><p>ξ c ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) (12)</p><p>= 3 [ 2 ( 2 k + 5 ) + 6 [ ( k + 3 ) + ( k + 4 ) + ⋯ + ( 2 k + 4 ) ] ] (13)</p><p>= 3 [ 2 ( 2 k + 5 ) + 6 [ ( k + 3 ) + ( 2 k + 4 ) ] ( k + 2 ) 2 ] (14)</p><p>= 27 k 2 + 129 k + 156. (15)</p><p>This completes the proof. □</p><p>Theorem 4 Let G be a (4,6)-fullerene graph having lantern structure, and let the number of hexagon-layer in G be k ≥ 1 , see <xref ref-type="fig" rid="fig1">Figure 1</xref>. Then</p><p>ξ c e ( G ) = 24 ∑ i = 3 k + 3 1 k + i ; (16)</p><p>ξ c ( G ) = 36 k 2 + 108 k + 72. (17)</p><p>Proof. Checking G, we see that G is symmetry. By the symmetry of G, it is easy to obtain that the eccentricity sequence of G is ( 2 k + 3, ⋯ ,2 k + 3 ︷ 8 , 2 k + 2, ⋯ ,2 k + 2 ︷ 8 , ⋯ , k + 4, ⋯ , k + 4 ︷ 8 , k + 3, ⋯ , k + 3 ︷ 8 ). By (1) and (2), we have</p><p>ξ c e ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) (18)</p><p>= 3 [ ( 1 2 k + 3 + 1 2 k + 2 + ⋯ + 1 k + 3 ) &#215; 8 ] (19)</p><p>= 24 ∑ i = 3 k + 3 1 k + i . (20)</p><p>and</p><p>ξ c ( G ) = ∑ v ∈ V ( G ) d ( v ) ε ( v ) (21)</p><p>= 3 [ 8 [ ( k + 3 ) + ( k + 4 ) + ⋯ + ( 2 k + 2 ) + ( 2 k + 3 ) ] ] (22)</p><p>= 3 [ 8 [ ( k + 3 ) + ( 2 k + 3 ) ] ( k + 1 ) 2 ] (23)</p><p>= 36 k 2 + 108 k + 72. (24)</p><p>The proof of the theorem is now complete. □</p></sec><sec id="s3"><title>3. Conclusion</title><p>In this note, we give calculation formulas of ECI and CEI of all (4,6)-fullerenes with regular structures, respectively. In the future, we will discuss the calculation of ECI and CEI of a (4,6)-fullerene graph of dispersive structure, and try to give an algorithm.</p></sec><sec id="s4"><title>Conflict of Interests</title><p>The authors declare that there is no conflict of interests regarding the publication of this paper.</p></sec><sec id="s5"><title>Acknowledgements</title><p>The work is supported by the Natural Science Foundation of Qinghai Province (2016-ZJ-947Q), the Ministry of Education Chunhui Project (No. Z2017047) and the High-level Personnel of Scientific Research Project of QHMU (2016XJG07).</p></sec><sec id="s6"><title>Cite this paper</title><p>Wu, T.Z. and Wu, Y. (2018) On the ECI and CEI of Boron-Nitrogen Fullerenes. Applied Mathematics, 9, 891-896. https://doi.org/10.4236/am.2018.98061</p></sec></body><back><ref-list><title>References</title><ref id="scirp.86650-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Sharma, V., Goswami, R. and Madan, A.K. (1997) Eccentric Connectivity index: A Novel Highly Discriminating Topological Descriptor for Structure-Property and Structure-Activity Studies. Journal of Chemical Information and Computer Sciences, 37, 273-282. https://doi.org/10.1021/ci960049h</mixed-citation></ref><ref id="scirp.86650-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Ashrafi, A.R., Doslic, T. and Saheli, M. (2011) The Eccentric Connectivity Index of TUC4C8(R) Nanotubes. MATCH Communications in Mathematical and in Computer Chemistry, 65, 221-230.</mixed-citation></ref><ref id="scirp.86650-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">Doslic, T., Saheli, M. and Vukicevic, D. (2010) Eccentric Connectivity Index: Extremal Graphs and Values. Iranian Journal of Mathematical Chemistry, 1, 45-56.</mixed-citation></ref><ref id="scirp.86650-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Dureja, H., Gupta, S. and Madan, A.K. (2008) Predicting Anti-HIV-1 Activity of 6-Arylbenzonitriles: Computational Approach Using Superaugmented Eccentric Connectivity Topochemical Indices. Journal of Molecular Graphics, 26, 1020-1029.  
https://doi.org/10.1016/j.jmgm.2007.08.008</mixed-citation></ref><ref id="scirp.86650-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Yu, G., Feng, L. and Ilic, A. (2011) On the Eccentric Distance Sum of Trees and unicyclic Graphs. Journal of Mathematical Analysis and Applications, 375, 99-107.  
https://doi.org/10.1016/j.jmaa.2010.08.054</mixed-citation></ref><ref id="scirp.86650-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, J., Zhou, B. and Liu, Z. (2012) On the Minimal Eccentric Connectivity Indices of Graphs. Discrete Mathematics, 312, 819-829.  
https://doi.org/10.1016/j.disc.2011.10.006</mixed-citation></ref><ref id="scirp.86650-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Zhou, B. and Du, Z. (2010) On Eccentric Connectivity Index. MATCH Communications in Mathematical and in Computer Chemistry, 63, 181-198.</mixed-citation></ref><ref id="scirp.86650-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Gupta, S., Singh, M. and Madan, A.K. (2000) Connective Eccentricity Index: A Novel Topological Descriptor for Predicting Biological Activity. Journal of Molecular Graphics and Modelling, 18, 18-25.  
https://doi.org/10.1016/S1093-3263(00)00027-9</mixed-citation></ref><ref id="scirp.86650-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Azari, M. and Iranmanesh, A. (2013) Computing the Eccentric-Distance Sum for Graph Operations. Discrete Applied Mathematics, 161, 2827-2840.  
https://doi.org/10.1016/j.dam.2013.06.003</mixed-citation></ref><ref id="scirp.86650-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Li, S., Zhang, M., Yu, G. and Feng, L. (2012) On the Extremal Values of the eccentric Distance Sum of Trees. Journal of Mathematical Analysis and Applications, 390, 99-112. https://doi.org/10.1016/j.jmaa.2012.01.022</mixed-citation></ref><ref id="scirp.86650-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Yu, G. and Feng, L. (2013) On the Connective Eccentricity Index of Graphs. MATCH Communications in Mathematical and in Computer Chemistry, 69, 611-628.</mixed-citation></ref><ref id="scirp.86650-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Yu, G., Qu, H., Tang, L. and Feng, L. (2014) On the Connective Eccentricity Index of Trees and Unicyclic Graphs with Given Diameter. Journal of Mathematical Analysis and Applications, 420, 1776-1786.  
https://doi.org/10.1016/j.jmaa.2014.06.050</mixed-citation></ref><ref id="scirp.86650-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Xu, K., Das, K. and Liu, H. (2016) Some Extremal Results on the Connective Eccentricity Index of Graphs. Journal of Mathematical Analysis and Applications, 433, 803-817. https://doi.org/10.1016/j.jmaa.2015.08.027</mixed-citation></ref><ref id="scirp.86650-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Xu, K., Liu, M., Das, K., Gutman, I. and Furtula, B. (2014) A Survey on Graphs Extremal with Respect to Distance-Based Topological Indices. MATCH Communications in Mathematical and in Computer Chemistry, 71, 461-508.</mixed-citation></ref><ref id="scirp.86650-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Gao, Y. and Zhang, H. (2014) Clar Structure and Fries Set of Fullerenes and (4,6)-Fullerenes. Journal of Applied Mathematics, 2014, Article ID: 196792.  
https://doi.org/10.1155/2014/196792</mixed-citation></ref><ref id="scirp.86650-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Jiang, X. and Zhang, H. (2011) On Forcing Matching Number of Boron-Nitrogen Fullerene Graphs. Discrete Applied Mathematics, 159, 1581-1593.  
https://doi.org/10.1016/j.dam.2011.05.006</mixed-citation></ref><ref id="scirp.86650-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Zhang, H. and Liu, S. (2010) 2-Resonance of Plane Bipartite Graphs and Its Applications to Boron-Nitrogen Fullerenes. Discrete Applied Mathematics, 158, 1559-1569.  
https://doi.org/10.1016/j.dam.2010.05.012</mixed-citation></ref><ref id="scirp.86650-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Wei, Z. and Zhang, H. (2017) 2-Resonance of Plane Bipartite Graphs and Its Applications to Boron-Nitrogen Fullerenes. MATCH Communications in Mathematical and in Computer Chemistry, 77, 707-724.</mixed-citation></ref></ref-list></back></article>