Some Computational Aspects of Boron Triangular Nanotubes

The recent discovery of boron triangular nanotubes competes with carbon in many respects. The closed form of M-polynomial of nanotubes produces closed forms of many degree-based topological indices which are numerical parameters of the structure and, in combination, determine properties of the concerned nanotubes. In this report, we give M-polynomials of boron triangular nanotubes and recover many important topological degree-based indices of these nanotubes. We also plot surfaces associated with these nanotubes that show the dependence of each topological index on the parameters of the structure.


Introduction
Nanotechnology is creating new structures between 1 and 100 nm.It creates many new materials and devices with a wide range of applications in medicine, electronics, and computers.Nanotechnology is expected to revolutionize the 21st century.Amongst the nanomaterials, nanocrystals, nanowires, and nanotubes constitute three major categories, the last two being one-dimensional.Since the discovery of carbon nanotubes in 1991, interests in one-dimensional nanomaterials has remarkably grown, and a phenomenal number of research articles are being published on nanotubes as well as on nanowires.Nanotubes are 3-D structures formed out of a 2-D lattice.The most significant nanotubes are carbon nanotubes and boron triangular nanotubes (Figure 1).
Boron nanotubes are becoming increasingly interesting because of their remarkable properties, such as their structural stability, work function, transport properties, and electronic structure [1].A boron triangular sheet is obtained from a carbon hexagonal sheet by adding an extra atom to the center of each hexagon (Figure 2).Scientists believe that boron triangular nanotubes are a better conductor than carbon hexagonal nanotubes.In chemical graph theory, a molecular graph is a simple graph (having no loops and multiple edges) in which atoms and chemical bonds between them are represented by vertices and edges, respectively.A graph ( , ) G V E with vertex set V(G) and edge set E(G) is connected if there is a connection between any pair of vertices in G.A network is simply a connected graph having no multiple edges and loops.The degree of a vertex is the number of vertices which are connected to that fixed vertex by the edges.In a chemical graph, the degree of any vertex is at most 4. The distance between two vertices u and v is denoted as ( , ) ( , ) and is the length of shortest path between u and v in graph G.The number of vertices of G, adjacent to a given vertex v, is the "degree" of this vertex, and will be denoted by The concept of degree is somewhat closely related to the concept of valence in chemistry.For details on the basics of graph theory, any standard text such as [2] can be of great help.
Cheminformatics is another emerging field in which quantitative structure-activity (QSAR) and structure-property (QSPR) relationships predict the biological activities and properties of the nanomaterial.In these studies, some physico-chemical properties and topological indices are used to predict bioactivity of the chemical compounds [3][4][5][6][7].Algebraic polynomials have also useful applications in chemistry, such as Hosoya polynomial (also called Wiener polynomial) [8], which  In chemical graph theory, a molecular graph is a simple graph (having no loops and multiple edges) in which atoms and chemical bonds between them are represented by vertices and edges, respectively.A graph ( , ) G V E with vertex set V(G) and edge set E(G) is connected if there is a connection between any pair of vertices in G.A network is simply a connected graph having no multiple edges and loops.The degree of a vertex is the number of vertices which are connected to that fixed vertex by the edges.In a chemical graph, the degree of any vertex is at most 4. The distance between two vertices u and v is denoted as ( , ) ( , ) and is the length of shortest path between u and v in graph G.The number of vertices of G, adjacent to a given vertex v, is the "degree" of this vertex, and will be denoted by simply by v d .The concept of degree is somewhat closely related to the concept of valence in chemistry.For details on the basics of graph theory, any standard text such as [2] can be of great help.
Cheminformatics is another emerging field in which quantitative structure-activity (QSAR) and structure-property (QSPR) relationships predict the biological activities and properties of the nanomaterial.In these studies, some physico-chemical properties and topological indices are used to predict bioactivity of the chemical compounds [3][4][5][6][7].Algebraic polynomials have also useful applications in chemistry, such as Hosoya polynomial (also called Wiener polynomial) [8], which plays a vital role in determining distance-based topological indices.Among other algebraic In chemical graph theory, a molecular graph is a simple graph (having no loops and multiple edges) in which atoms and chemical bonds between them are represented by vertices and edges, respectively.A graph G(V, E) with vertex set V(G) and edge set E(G) is connected if there is a connection between any pair of vertices in G.A network is simply a connected graph having no multiple edges and loops.The degree of a vertex is the number of vertices which are connected to that fixed vertex by the edges.In a chemical graph, the degree of any vertex is at most 4. The distance between two vertices u and v is denoted as d(u, v) = d G (u, v) and is the length of shortest path between u and v in graph G.The number of vertices of G, adjacent to a given vertex v, is the "degree" of this vertex, and will be denoted by d v (G) or, if misunderstanding is not possible, simply by d v .The concept of degree is somewhat closely related to the concept of valence in chemistry.For details on the basics of graph theory, any standard text such as [2] can be of great help.
Cheminformatics is another emerging field in which quantitative structure-activity (QSAR) and structure-property (QSPR) relationships predict the biological activities and properties of the nanomaterial.In these studies, some physico-chemical properties and topological indices are used to predict bioactivity of the chemical compounds [3][4][5][6][7].Algebraic polynomials have also useful applications in chemistry, such as Hosoya polynomial (also called Wiener polynomial) [8], which plays a vital role in determining distance-based topological indices.Among other algebraic polynomials, the M-polynomial [9], introduced in 2015, plays the same role in determining the closed form of many degree-based topological indices [10][11][12][13][14].The main advantage of M-polynomial is the wealth of information that it contains about degree-based graph invariants.In this article, we compute a closed form of some degree-based topological indices of boron triangular nanotubes by using an M-polynomial.Definition 1. [9] The M-polynomial of G is defined as where Weiner, in 1947 approximated the boiling point of alkanes as αW(G) + βP 3 + γ, where α, β, and γ are empirical constants, W(G) is the Weiner index, and P 3 is the number of paths of length 3 in G [15].Thus, Weiner laid the foundation of Topological index, which is also known as the connectivity index.Many chemical experiments require the determination of the chemical properties of emerging nanotubes and nanomaterials.Chemical-based experiments reveal that, out of more than 140 topological indices, no single index in strong enough to determine many physico-chemical properties, although, in combination, these topological indices can do this to some extent.The Wiener index is originally the first and most studied topological index (for details, [16,17]).The Randić index, [18] denoted by R − 1 2 (G) and introduced by Milan Randić in 1975, is also one of the oldest topological indexes.The Randić index is defined as In 1998, working independently, Bollobas and Erdos [19] and Amic et al. [20] proposed the generalized Randić index and has been studied extensively by both chemists and mathematicians [21], and many mathematical properties of this index have been discussed in [22].For a detailed survey, refer to [23].
The general Randić index is defined as and the inverse Randić index is defined as The Randić index is also the most popular, the most often applied, and the most studied among all other topological indices.Many papers and books such as [24,25] are written on this topological index.Randić himself wrote two reviews on his Randić index [26,27], and there are three other reviews [28][29][30].The suitability of the Randić index for drug design was immediately recognized; eventually, the index was used for this purpose, and now has been used on countless occasions.The physical reason for the success of such a simple graph invariant is still an enigma, although several more-or-less plausible explanations were offered.
Gutman and Trinajstić introduced first Zagreb index and second Zagreb index, which are defined as , respectively.For detail about these indices, we refer the reader to [31][32][33][34][35].
Both the first Zagreb index and the second Zagreb index give greater weights to the inner vertices and edges, and smaller weights to the outer vertices and edges, which opposes intuitive reasoning.Hence, they were amended as follows [36]: for a simple connected graph G, the second modified Zagreb index is defined as The symmetric division index [SDD] is one of the 148 discrete Adriatic indices and is a good predictor of the total surface area for polychlorobiphenyls [37].The symmetric division index of a connected graph G is defined as Another variant of the Randić index is the harmonic index, defined as As far as we know, this index first appeared in [38].Favaron et al. [39] considered the relation between the harmonic index and the eigenvalues of graphs.
The inverse sum-index is the descriptor that was selected in [40] as a significant predictor of the total surface area of octane isomers and for which the extremal graphs obtained with the help of MathChem have a particularly simple and elegant structure.The inverse sum-index is defined as The augmented Zagreb index of G proposed by Furtula et al. [41] is defined as This graph invariant has proven to be a valuable predictive index in the study of the heat of formation in octanes and heptanes [41], whose prediction power is better than the atom-bond connectivity index (please refer to [42][43][44] for its research background).Moreover, the tight upper and lower bounds for the augmented Zagreb index of chemical trees, and the trees with minimal augmented Zagreb index, were obtained in [41].
The following Table 1 relates some well-known degree-based topological indices with M-polynomials [9].where

Results
In this section, we provide our computational results.

M-Polynomials
In Figure 3, we represent a boron triangular nanotube, by a planar graph, BNT t [m, n] of order n × m, where m and n represent the number of items in each row and each column, respectively.There are 3nm  2 vertices and 3m(3n−2) 2 edges in the 2D lattice graph of boron triangular nanotubes.

Results
In this section, we provide our computational results.

M-Polynomials
In Figure 3   There are two types of vertices with respect to degree, i.e., The partition of the edge set of BNT t [m, n] is given in Table 2.

Topological Indices
BNT m n be the boron triangular nanotube.Then,

Topological Indices
Proposition 1.Let BNT t [m, n] be the boron triangular nanotube.Then, Now, from Table 1, Now, from Table 1,

Conclusions and Discussion
In this article, we computed the closed form of M-polynomial for boron triangular nanotubes.Then, we derived many degree-based topological indices for boron triangular nanotubes.These indices can help us to understand its physical features, chemical reactivity, and biological activities, such as the boiling point, the heat of formation, the fracture toughness, the strength, the conductivity, and the hardness.From this point of view, a topological index can be regarded as a score function that maps each molecular structure to a real number and is used as a descriptor of the molecule under testing.These results can also play a vital part in the determination of the significance of boron triangular nanotubes in electronics and industry.Because of its hardness, it can be used in the preparation of armor.We also want to remark that similar techniques can be used to determine M-polynomials and topological indices about α-boron nanotubes.Now, we provide the computer-based analysis of each topological index with involved parameters.Although graphs are similar, but have different gradients; see Figure 5.

Conclusions and Discussion
In this article, we computed the closed form of M-polynomial for boron triangular nanotubes.Then, we derived many degree-based topological indices for boron triangular nanotubes.These indices can help us to understand its physical features, chemical reactivity, and biological activities, such as the boiling point, the heat of formation, the fracture toughness, the strength, the conductivity, and the hardness.From this point of view, a topological index can be regarded as a score function that maps each molecular structure to a real number and is used as a descriptor of the molecule under testing.These results can also play a vital part in the determination of the significance of boron triangular nanotubes in electronics and industry.Because of its hardness, it can be used in the preparation of armor.We also want to remark that similar techniques can be used to determine M-polynomials and topological indices about  -boron nanotubes.Now, we provide the computer-based analysis of each topological index with involved parameters.Although graphs are similar, but have different gradients; see Figure 5.
, we represent a boron triangular nanotube, by a planar graph, of order n  m, where m and n represent the number of items in each row and each column, edges in the 2D lattice graph of boron triangular nanotubes.

Figure 4 .
Figure 4. 3D plot of the M-polynomial of

Figure 4 .
Figure 4. 3D plot of the M-polynomial of BNT t [m, n].

Table 1 .
Derivation of some degree-based topological indices from M-polynomials.

Table 2 .
Edge partition of edge set of BNT t [m, n].