^{1}

^{*}

^{2}

^{*}

^{3}

^{*}

^{4}

^{*}

Chemical graph theory is an important branch of mathematical chemistry which has wide range applications. In chemical graph theory a molecular graph can be recognized by a numerical quantity which is called a Topological index. Topological indices have some major classes but among these classes degree based topological indices have prominent role in chemical graph theory. In this paper we compute the edge version of some important degree based topological indices like Augmented Zagreb Index, Hyper-Zagreb Index, Harmonic Index and Sum-Connectivity Index of NA
_{q}
^{p} Nanotube.

Graph theory is an important branch of mathematics which is started by Leonhard Euler’s as early as 1736. A hundred year before an important contribution of Kirchhoff had been made for the analysis of electrical networks. Several properties of special types of graphs known as trees were discovered by Cayley and Sylvester. The first book on graph theory was published in 1936 which received more attention. After the Second World War, further books were published on graph theory. Since then graph theory became one of the fastest expanding branches of mathematics.

Graph theory has many applications in engineering and science such as chemical, civil, electrical and mechanical engineering, architecture, management and control, communication, operational research, sparse matrix technology, combinatorial optimisation, physics, biology and computer science. But in chemistry graph theory has wide range applications; it has very important contributions in chemical documentation, structural chemistry, physical chemistry, inorganic chemistry, quantum chemistry, organic chemistry, chemical synthesis, polymer chemistry, medicinal chemistry, genomics, DNA studies and recent date proteomics.

Chemical graph theory is very important branch of mathematical chemistry. Its pioneers are Alexandru Balaban, Ante Graovac, Ivan Gutman, Haruo Hosoya, Milan Randić and Nenad Trinajstić. In chemical graph theory we use algebraic invariants to minimize the structure of a molecule into a single number which denotes the energy of molecule, structural fragments, molecular branching and electronic structures. Physical observations calculated by experiments are used to associate with these graphs theoretic invariants.

A graph G consists of a vertex set V ( G ) and edge set E ( G ) . Two vertices of G connected by an edge, are said to be adjacent. The Degree of a vertex v is the number of vertices adjacent with vertex v which is denoted by d e g ( v ) . The carbon-atom skeleton of an organic molecule is represented with a molecular graph. In molecular graph vertices represents the carbon atoms and edges represents the bonds between the carbon atoms.

A topological index is a structural descriptor which is derived from a molecular graph that represents an efficient way to express in a numerical form the molecular size, shape, cyclicity and branching. The topological indices of molecular graphs are widely used for establishing correlations between the structure of a molecular compound and its physico-chemical properties or biological activity. There are some major classes of topological indices such as distance based topological indices, degree based topological indices, eccentricity based topological indices and counting related polynomials and indices of graphs. Among these classes degree based topological indices are of great importance and play a vital role in chemical graph theory and particularly in chemistry [

The concept of topological indices was given by Wiener while he was working on boiling point of paraffin, named this index as path number. Later on, the path number was renamed as Wiener index [

Let G be a molecular graph. Then the Wiener index of G is defined as

W ( G ) = 1 2 ∑ ( u , v ) d ( u , v ) (1)

where ( u , v ) is any ordered pair of vertices in G and d ( u , v ) is the distance between the vertex u and vertex v.

The first degree based topological index is Randic index which was given by Milan Randic in 1975 in his paper On characterization of molecular branching [

R − 1 2 ( G ) = ∑ u v ∈ E ( G ) 1 d e g ( u ) d e g ( v ) (2)

In this article we compute the edge version some important degree based topological indices which are Augmented Zagreb Index, Hyper-Zagreb Index, Harmonic Index and Sum-Connectivity Index of N A q p Nanotube. Now we define the edge versions of Augmented Zagreb Index, Hyper-Zagreb Index, Harmonic Index and Sum-Connectivity Index.

Furtula et al. [

e A Z I ( G ) = ∑ e f ∈ E ( L ( G ) ) ( d e g L ( G ) ( e ) ⋅ d e g L ( G ) ( f ) d e g L ( G ) ( e ) + d e g L ( G ) ( f ) − 2 ) 3 (3)

As compared to Atom bond connectivity index Augmented Zagreb Index has better correlation potential [

The Hyper-zagreb index was introduced by G.H Shirdel, H. Rezapour and A.M. Sayadi [

e H M ( G ) = ∑ e f ∈ E ( L ( G ) ) ( d e g L ( G ) ( e ) + d e g L ( G ) ( f ) ) 2 (4)

Zhang [

e H ( G ) = ∑ e f ∈ E ( L ( G ) ) 2 d e g L ( G ) ( e ) + d e g L ( G ) ( f ) (5)

Bo Zhou and Nenad Trinajstic [

e S C I ( G ) = ∑ e f ∈ E ( L ( G ) ) 1 d e g L ( G ) ( e ) + d e g L ( G ) ( f ) (6)

Carbon nanotubes are the allotropic forms of carbon with a cylindrical nanostructures. Carbon nanotubes form an interesting class of carbon nonmaterial. There are three types of nanotubes namely, armchair, chiral and zigzag structures nanotubes. These carbon nanotubes shows remarkable mechanical properties. Experimental studies have shown that they belong to the stiffest and elastic known materials. Diudea was the first chemist who consider the problem of topological indices of nano-structures. In this paper we continue this program and compute some degree based topological indices of line graph of N A q p nanotube.

We consider the q × p quadrilateral section P q p with q ≥ 2 hexagons on the top and bottom sides and q ≥ 2 hexagons on the lateral sides cut from the regular hexagonal lattice L. If we identify two lateral sides of P q p such that we identify the vertices u 0 j and u q j , for j = 0 , 1 , 2 , ⋯ , p then we obtain the nanotube N A q p shown in

We now compute the edge version of augmented zagreb index, hyper-zagreb index, harmonic index and sum-connectivity index of N A q p nanotube. Throughout this figure we consider p = q ≥ 2 . The line graph of N A q p nanotube has 6 p 2 + p + s + k − 5 edges with degree vertices 2, 3 and 4. The first edge partition has s edges with d L ( G ) ( e ) = d L ( G ) ( f ) = 2 the second edge partition has 2 p + 2 edges with d L ( G ) ( e ) = 2 and d L ( G ) ( f ) = 3 , the third edge partition has k edges with d L ( G ) ( e ) = 2 and d L ( G ) ( f ) = 4 , the fourth edge partition has 4 p − 6 edges with d L ( G ) ( e ) = d L ( G ) ( f ) = 3 , the fifth edge partition has 8 p − 8 edges with d L ( G ) ( e ) = 3 and d L ( G ) ( f ) = 4 and the sixth edge partition has 6 p 2 − 13 p + 7 edges with d L ( G ) ( e ) = d L ( G ) ( f ) = 4 .

Theorem 2.2.1. For every p = q ≥ 2 , consider the graph of G ≅ N A q p nano-

tube. Then the e A Z I ( G ) is equal to

e A Z I ( G ) = 3072 27 p 2 − 4015657 54000 p + 8 s + 8 k − 3261061 108000

Proof. Let G be the graph of N A q p nanotube. Since from (3) we have

e A Z I ( G ) = ∑ e f ∈ E ( L ( G ) ) ( d e g L ( G ) ( e ) ⋅ d e g L ( G ) ( f ) d e g L ( G ) ( e ) + d e g L ( G ) ( f ) − 2 ) 3

By using edge partition in

e A Z I ( G ) = s × ( 2 × 2 2 + 2 − 2 ) 3 + ( 2 p + 2 ) × ( 2 × 3 2 + 3 − 2 ) 3 + k × ( 2 × 4 2 + 4 − 2 ) 3 + ( 4 p − 6 ) × ( 3 × 3 3 + 3 − 2 ) 3 + ( 8 p − 8 ) × ( 3 × 4 3 + 4 − 2 ) 3 + ( 6 p 2 − 13 p + 7 ) × ( 4 × 4 4 + 4 − 2 ) 3

After an easy simplification, we obtain

e A Z I ( G ) = 3072 27 p 2 + ( 2916 64 + 13824 125 − 6656 27 + 16 ) p + 8 s + 8 k + 3584 27 − 2187 32 − 13824 125 + 16

After more simplification, we get

⇒ A e Z I ( G ) = 3072 27 p 2 − 4015657 54000 p + 8 s + 8 k − 3261061 108000

Theorem 2.2.2. For every p = q ≥ 2 , consider the graph of G ≅ N A q p nanotube. Then the e H M ( G ) is equal to

e H M ( G ) = 384 p 2 − 246 p + 16 s + 36 k − 110

Proof. Let G be the graph of N A q p nanotube. Since from (4) we have

e H M ( G ) = ∑ e f ∈ E ( L ( G ) ) ( d e g L ( G ) ( e ) + d e g L ( G ) ( f ) ) 2

By using edge partition in