Computing Topological Indices and Polynomials for Line Graphs

A topological index is a number related to the atomic index that allows quantitative structure–action/property/toxicity connections. All the more vital topological indices correspond to certain physico-concoction properties like breaking point, solidness, strain vitality, and so forth, of synthetic mixes. The idea of the hyper Zagreb index, multiple Zagreb indices and Zagreb polynomials was set up in the substance diagram hypothesis in light of vertex degrees. These indices are valuable in the investigation of calming exercises of certain compound systems. In this paper, we computed the first and second Zagreb index, the hyper Zagreb index, multiple Zagreb indices and Zagreb polynomials of the line graph of wheel and ladder graphs by utilizing the idea of subdivision.


Introduction
Chemical graph theory is a branch of mathematical chemistry in which we apply apparatuses of the graph hypothesis to display the substance numerically.This hypothesis contributes noticeably to the synthetic sciences.A sub-atomic diagram is a straightforward limited graph in which vertices mean that the atoms and edges indicate concoction bonds in hidden compound structure.A topological index is actually a numerical amount related to the concoction constitution indicating the connection of the substance structure with numerous physio-synthetic properties, compound reactivity, and organic action.A decade ago, the diagram hypothesis found extensive use in research.The graph hypothesis has given physicists a variety of valuable apparatuses, such as topological files.Cheminformatics is a new subject that is a mix of science, arithmetic, and data science.It ponders quantitative structure-movement (QSAR) and structure-property (QSPR) connections that are utilized to anticipate the natural exercises and properties of synthetic mixes.
A graph G with vertex set V and edge set E are associated if there exists a connection between any combination of vertices in G.A network is just a connected diagram having no various edges and no self loops.For a graph G, the level of a vertex v is the quantity of edges occurrence to v and is indicated by ξ(v).
A topological list Top(G) of a graph G is a number with the property that for each chart H isomorphic to G, Top(H) = Top(G).The idea of the topological file originated from the work done by Wiener [1], while at the same time, he was aiming to determine the breaking point of paraffin.He named this list as the way number.Later on, the way number was renamed as the Wiener index.The Wiener list is the first and most concentrated topological list, both from hypothetical and applications perspectives, and is characterized as the aggregate of separations between all sets of vertices in G (see [2] for details).

Applications of Topological Indices
A ago, graph hypothesis had found an amazing use in research.Compound graph speculation has given researchers a variety of important gadgets (e.g., topological files).The Zagreb index is a topological descriptor that is related to a considerable measure of fabricated attributes of the particles, and has been discovered parallel to setting up the limit and Kovats constants of the particles [10].The particle bond arranged hyper Zagreb index has a superior relationship with the security of direct dendrimers, besides the expanded medication stores and for setting up the strain criticalness of cycloalkanes [11][12][13][14][15].To relate with certain physico-mix properties, different Zagreb indices have particularly needed insightful control over the farsighted essentialness of the dendrimers [16,17].The first and second Zagreb polynomials were found to aid in the calculation of the aggregate π-electron imperativeness of the particles inside particular brutal verbalizations [18,19].

Topological Indices for Line Graph of Subdivided Graph L(S(G))
The subdivision graph [20]  The tadpole graph T n,k is the diagram acquired by joining a cycle diagram C n to a way of length k.By beginning with a disjoint association of two charts G 1 and G 2 and including edges joining every vertex of G 1 to that of G 2 , one gets the whole G 1 + G 2 of G 1 and G 2 .The total C n + K 1 of a cycle C n and a solitary vertex is alluded to as a wheel chart W n+1 with arrange n.The Cartesian product and two vertices r 1 , s 1 and r 2 , s 2 are nearby in G 1 × G 2 if and only if either r 1 = r 2 and s 1 s 2 ∈ E 2 , or s 1 = s 2 and r 1 r 2 ∈ E 1 .The stepping stool diagram L n is given by L n = K 2 × P n , where P n is the way of length n.It is along these lines proportionate to the framework chart G 2,n .The diagram acquired by means of this definition resembles a stepping stool, having two rails and n rungs between them.
In 2011, Ranjini et al. figured the unequivocal articulations for the Schultz lists of the subdivision diagrams of the tadpole, wheel, steerage, and stepping stool charts.They additionally contemplated the Zagreb records of the line diagrams of the tadpole, haggle charts with subdivision in [21,22].Ali et al. [23] registered the topological lists for the line diagram of the sparkler chart, and Sardar et al. [24] computed the topological files of the line diagrams of Banana tree and Firecracker diagrams.Ahmad et al. [25] discuss the m-polynomials and degree-based topological indices for the line graph of the Firecracker graph.Soleimani et al. [26] discuss the topological properties of nanostructures.In 2015, Su and Xu figured the general aggregate availability records and co-lists of the line diagrams of the tadpole and haggle charts with subdivision in [27].Nadeem et al. [28,29] registered ABC 4 and GA 5 records of the line charts of the tadpole, wheel, stepping stool, 2D−lattice, nanotube, and nanotorus of TUC 4 C 8 [p, q] diagrams.

Zagreb Indices and Zagreb Polynomials of the Line Graph of the Tadpole Graph T n,k
Theorem 1.Let R be the line graph of the tadpole graph T n,k .Then Proof.The subdivision diagram of T n,k and the related line chart R appear individually in Figure 1a,b.The subdivision chart S(T n,k ) contains 2n + 2k edges, so its line diagram contains 2n + 2k vertices, out of which 3 vertices are of degree 3 and one vertex is of degree 1.The rest of the 2n + 2k − 4 vertices are all of degree 2. It is easy to see that the aggregate number of edges of R is 2n + 2k + 1.The edge set E(R) separates into our edge segments in view of degrees of end vertices: These four partitions of the edge set correspond to their degree sum of neighbors of end vertices.The number of edges in E 12 R is 1, in E 22 R there are 2n + 2k − 6, in E 23 R there are 3, and in E 33 R there are 3. Now, using Equations ( 1)-( 7), we have x [ξ(r 1 )+ξ(r 2 )] , x [ξ(r 1 )×ξ(r 2 )] , Theorem 2. Let H be the line graph of the wheel graph W n+1 .Then Proof.The subdivision chart of wheel W n+1 and the relating line diagram H appear separately in Figure 2a,b.The line chart H contains 4n vertices, of which 3n vertices are of degree 3 and the others are of degree n.It is simple to determine that the aggregate number of edges in the line diagram H are n 2 + 9n 2 .To demonstrate the above proclamation, the edge set E(H) isolates into three edge segments in light of the degrees of end vertices: These three partitions of the edge set correspond to their degree sum of neighbors of end vertices.

Conclusions
In this paper we determined first and second Zagreb record, Hyper Zagreb index, first numerous Zagreb index, second different Zagreb index, and Zagreb polynomials of the line chart of tadpole and haggle diagrams by utilizing the idea of subdivision.
In the past couple of decades, investigations of the topological indices in view of end-vertex degrees of edges have seen a significant increase.The issue of determining the estimations of some outstanding degree-based topological indices is completely addressed for the line diagram of the subdivision graphs.This provides a path forward in this field of research.Also, in future we are intrigued to register these records for the line diagrams of some outstanding graphs.
S(G) is the diagram acquired from G by supplanting every one of its edges by a way of length 2, or equivalently, by embedding an extra vertex into each edge of G.The line diagram of the chart G, composed L(G), is the basic diagram whose vertices are the edges of G, with e f ∈ E(L(G)) when e and f have a typical end point in G.Likewise, the line chart of the subdivided diagram is indicated by L(S(G)).

Figure 1 .
Figure 1.(a) Subdivision graph of the tadpole graph T n,k ; (b) Line graph of the subdivision graph of (T n,k ).

Figure 2 .
Figure 2. (a) Subdivision graph of wheel graph W n+1 ; (b) Line graph of the subdivision graph of the wheel graph W n+1 .

Figure 3 .
Figure 3. (a) Subdivision graph of the ladder graph L n ; (b) Line graph of the subdivision graph of the ladder graph L n .