All graphs considered in this paper are simple connected graphs. Let G be a graph with vertex set and edge set . Let , denotes the degree of v. For vertices , the distance is defined as the length of a shortest path between u and v in G. The eccentricity of a vertex v is the maximum distance from v to any other vertex.
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.
Sharma et al.  introduced a distance-based molecular structure descriptor, the eccentric connectivity index (ECI for short) defined as
A novel graph invariant for predicting biological and physical properties―connective eccentricity index (CEI briefly) was introduced by Gupta et al.  , which was defined as:
Some recent results on the CEI of graphs can be found in  -  .
Boron-nitrogen fullerene is a member of the fullerene family, it has been extensively studied    . 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
six faces of size 4 and faces of size 6.
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  given a classification of all (4,6)-fullerenes as follows.
Lemma 1  Let G be a (4,6)-fullerene graph. Then G can be of one of the following five types:
1) a cube,
2) a hexagonal prism,
3) a tubular graph with at least one hexagon-layer,
4) a (4,6)-fullerene graph of lantern structure,
5) a (4,6)-fullerene graph of dispersive structure,
where the resulting graphs see Figure 1.
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.
2. Computing Formula of ECI and CEI of a (4,6)-Fullerene
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.
Theorem 2 Let G be a (4,6)-fullerene graph. Then
Figure 1. The (4,6)-fullerenes in Lemma 1.
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
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
Theorem 3 Let G be a tubular graph, and let the number of hexagon-layer in G be . Then
Proof. Let v be a vertex of G. By the structure of G (see Figure 1), we know that the eccentricity of v equal to the distance between v and u (or u’). Thus, the eccentricity sequence of G is ( , , , , , ). By (1) and (2), we obtain
This completes the proof. □
Theorem 4 Let G be a (4,6)-fullerene graph having lantern structure, and let the number of hexagon-layer in G be , see Figure 1. Then
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 ( , , , , ). By (1) and (2), we have
The proof of the theorem is now complete. □
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.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
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).
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.
 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.