Next Article in Journal
Intuitionistic Falling Shadow Theory with Applications in BCK/BCI-Algebras
Next Article in Special Issue
Computing The Irregularity Strength of Planar Graphs
Previous Article in Journal
Energy of Pythagorean Fuzzy Graphs with Applications
Previous Article in Special Issue
Eccentricity Based Topological Indices of an Oxide Network
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Computing Topological Indices and Polynomials for Line Graphs

1
Govt Khawaja Rafique Shaheed College, Lahore 54000, Pakistan
2
Department of Mathematics, COMSATS University Islamabad, Sahiwal Campus, Sahiwal 57000, Pakistan
3
Department of Mathematical Sciences, United Arab Emirates University, P. O. Box 15551, Al Ain, UAE
4
Department of Mathematics, School of Natural Sciences (SNS), National University of Sciences and Technology (NUST), Sector H-12, Islamabad 44000, Pakistan
5
Department of Mathematics, COMSATS University Islamabad, Lahore Campus, Lahore 54000, Pakistan
*
Author to whom correspondence should be addressed.
Mathematics 2018, 6(8), 137; https://doi.org/10.3390/math6080137
Submission received: 16 July 2018 / Revised: 31 July 2018 / Accepted: 5 August 2018 / Published: 10 August 2018
(This article belongs to the Special Issue Discrete Optimization: Theory, Algorithms, and Applications)

Abstract

:
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.

1. 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 T o p ( G ) of a graph G is a number with the property that for each chart H isomorphic to G, T o p ( H ) = T o p ( 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).
I. Gutman and N.Trinajstic [3] introduced the first and second Zagreb indices based on the degree of vertices as:
M 1 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) + ξ ( r 2 ) ] ,
M 2 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) × ξ ( r 2 ) ] .
In 2013, Shirdel et al. [4] introduced the “hyper Zagreb index” as:
H M ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) + ξ ( r 2 ) 2 .
M. Ghorbani and N. Azimi defined [5] multiple Zagreb indices as:
P M 1 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) + ξ ( r 2 ) ] ,
P M 2 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) × ξ ( r 2 ) ] .
The properties of P M 1 ( G ) , P M 2 ( G ) indices for some chemical structures have been studied in [6]. The first Zagreb polynomial M 1 ( G , x ) ) and second Zagreb polynomial M 2 ( G , x ) are defined as:
M 1 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] ,
M 2 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] .
There is now extensive research activity on H M ( G ) , P M 1 ( G ) , P M 2 ( G ) indices and M 1 ( G , x ) , M 2 ( G , x ) polynomials. See [7,8,9] for details.

2. 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].

3. Topological Indices for Line Graph of Subdivided Graph L ( S ( G ) )

The subdivision graph [20] 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 ) ) .
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 G 1 × G 2 of charts G 1 and G 2 is a diagram with vertex set V 1 × V 2 , 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 A B C 4 and G A 5 records of the line charts of the tadpole, wheel, stepping stool, 2 D lattice, nanotube, and nanotorus of T U C 4 C 8 [ p , q ] diagrams.

3.1. 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
M 1 ( R ) = 8 n + 8 k + 12 , M 2 ( R ) = 8 n + 8 k + 23 , H M ( R ) = 32 n + 32 k + 96 , P M 1 ( R ) = 3 × 4 ( 2 n + 2 k 6 ) × 5 3 × 6 3 , P M 2 ( R ) = 2 × 4 ( 2 n + 2 k 6 ) × 6 3 × 9 3 , M 1 ( R , x ) = x 3 + ( 2 n + 2 k 6 ) x 4 + 3 x 5 + 3 x 6 , M 2 ( R , x ) = x 2 + ( 2 n + 2 k 6 ) x 4 + 3 x 6 + 3 x 9 .
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 2 n + 2 k edges, so its line diagram contains 2 n + 2 k vertices, out of which 3 vertices are of degree 3 and one vertex is of degree 1. The rest of the 2 n + 2 k 4 vertices are all of degree 2. It is easy to see that the aggregate number of edges of R is 2 n + 2 k + 1 . The edge set E ( R ) separates into our edge segments in view of degrees of end vertices:
  • E 12 R = r 1 r 2 E R ξ ( r 1 ) = 1 , ξ ( r 2 ) = 2 ,
  • E 22 R = r 1 r 2 E R ξ ( r 1 ) = 2 , ξ ( r 2 ) = 2 ,
  • E 23 R = r 1 r 2 E R ξ ( r 1 ) = 2 , ξ ( r 2 ) = 3 ,
  • E 33 R = r 1 r 2 E R ξ ( r 1 ) = 3 , ξ ( r 2 ) = 3 .
 ☐
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 2 n + 2 k 6 , in E 23 R there are 3, and in E 33 R there are 3. Now, using Equations (1)–(7), we have
M 1 ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) + ξ ( r 2 ) , M 1 ( R ) = r 1 r 2 E 12 ( R ) ξ ( r 1 ) + ξ ( r 2 ) + r 1 r 2 E 22 ( R ) ξ ( r 1 ) + ξ ( r 2 ) + r 1 r 2 E 23 ( R ) ξ ( r 1 ) + ξ ( r 2 ) + r 1 r 2 E 33 ( R ) ξ ( r 1 ) + ξ ( r 2 ) = 3 | E 12 ( R ) | + 4 | E 22 ( R ) | + 5 | E 23 ( R ) | + 6 | E 33 ( R ) | = 3 ( 1 ) + 4 ( ( 2 n + 2 k 6 ) ) + 5 ( 3 ) + 6 ( 3 ) = 8 n + 8 k + 12 ,
M 2 ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) × ξ ( r 2 ) M 2 ( R ) = r 1 r 2 E 12 ( R ) ξ ( r 1 ) × ξ ( r 2 ) + r 1 r 2 E 22 ( R ) ξ ( r 1 ) × ξ ( r 2 ) + r 1 r 2 E 23 ( R ) ξ ( r 1 ) × ξ ( r 2 ) + r 1 r 2 E 33 ( R ) ξ ( r 1 ) × ξ ( r 2 ) = 2 | E 12 ( R ) | + 4 | E 22 ( R ) | + 6 | E 23 ( R ) | + 9 | E 33 ( R ) | = 2 ( 1 ) + 4 ( ( 2 n + 2 k 6 ) ) + 6 ( 3 ) + 9 ( 3 ) = 8 n + 8 k + 23 ,
H M ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) + ξ ( r 2 ) 2 , H M ( R ) = r 1 r 2 E 12 ( R ) ξ ( r 1 ) + ξ ( r 2 ) 2 + r 1 r 2 E 22 ( R ) ξ ( r 1 ) + ξ ( r 2 ) 2 + r 1 r 2 E 23 ( R ) ξ ( r 1 ) + ξ ( r 2 ) 2 + r 1 r 2 E 33 ( R ) ξ ( r 1 ) + ξ ( r 2 ) 2 = 9 | E 12 ( R ) | + 16 | E 22 ( R ) | + 25 | E 23 ( R ) | + 36 | E 33 ( R ) | = 9 ( 1 ) + 16 ( 2 n + 2 k 6 ) + 25 ( 3 ) + 36 ( 3 ) = 2 n + 32 k + 96 ,
P M 1 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) + ξ ( r 2 ) ] , P M 1 ( R ) = r 1 r 2 E 12 ( R ) ξ ( r 1 ) + ξ ( r 2 ) × r 1 r 2 E 22 ( R ) ξ ( r 1 ) + ξ ( r 2 ) × r 1 r 2 E 23 ( R ) ξ ( r 1 ) + ξ ( r 2 ) × r 1 r 2 E 33 ( R ) ξ ( r 1 ) + ξ ( r 2 ) = 3 | E 12 ( R ) | × 4 | E 22 ( R ) | × 5 | E 23 ( R ) | × 6 | E 33 ( R ) | = 3 × 4 ( 2 n + 2 k 6 ) × 5 3 × 6 3 ,
P M 2 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) × ξ ( r 2 ) ] , P M 2 ( R ) = r 1 r 2 E 12 ( R ) ξ ( r 1 ) × ξ ( r 2 ) × r 1 r 2 E 22 ( R ) ξ ( r 1 ) × ξ ( r 2 ) × r 1 r 2 E 23 ( R ) ξ ( r 1 ) × ξ ( r 2 ) × r 1 r 2 E 33 ( R ) ξ ( r 1 ) × ξ ( r 2 ) = 2 | E 12 ( R ) | × 4 | E 22 ( R ) | × 6 | E 23 ( R ) | × 9 | E 33 ( R ) | = 2 × 4 ( 2 n + 2 k 6 ) × 6 3 × 9 3 ,
M 1 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] , M 1 ( R , x ) = r 1 r 2 E 1 ( R ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] + r 1 r 2 E 2 ( R ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] + r 1 r 2 E 3 ( R ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] + r 1 r 2 E 4 ( R ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] = r 1 r 2 E 1 ( R ) x 3 + r 1 r 2 E 2 ( R ) x 4 + r 1 r 2 E 3 ( R ) x 5 + r 1 r 2 E 4 ( R ) x 6 = | E 12 ( R ) | x 3 + | E 22 ( R ) | x 4 + | E 23 ( R ) | x 5 + | E 33 ( R ) | x 6 = x 3 + ( 2 n + 2 k 6 ) x 4 + 3 x 5 + 3 x 6 ,
M 2 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] , M 2 ( R , x ) = r 1 r 2 E 1 ( R ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] + r 1 r 2 E 2 ( R ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] + r 1 r 2 E 3 ( R ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] + r 1 r 2 E 4 ( R ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] = r 1 r 2 E 1 ( R ) x 2 + r 1 r 2 E 2 ( R ) x 4 + r 1 r 2 E 3 ( R ) x 6 + r 1 r 2 E 4 ( R ) x 9 = | E 12 ( R ) | x 2 + | E 22 ( R ) | x 4 + | E 23 ( R ) | x 6 + | E 33 ( R ) | x 9 = x 2 + ( 2 n + 2 k 6 ) x 4 + 3 x 6 + 3 x 9 .
Theorem 2.
Let H be the line graph of the wheel graph W n + 1 . Then
M 1 ( H ) = n 3 + 27 n , M 2 ( H ) = n 4 n 3 + 6 n 2 + 72 n 2 , H M ( H ) = 2 n 4 n 3 + 6 n 2 + 45 n , P M 1 ( H ) = 6 4 n × ( 3 + n ) n × ( 2 n ) n 2 n 2 , P M 2 ( H ) = 9 4 n × ( 3 n ) n × n n 2 n , M 1 ( H , x ) = 4 n x 4 + n x 3 + n + n 2 n 2 x 2 n , M 2 ( H , x ) = 4 n x 9 + n x 3 n + n 2 n 2 x n 2 .
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 4 n vertices, of which 3 n 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 + 9 n 2 . To demonstrate the above proclamation, the edge set E ( H ) isolates into three edge segments in light of the degrees of end vertices:
  • E 33 H = r 1 r 2 E H ξ ( r 1 ) = 3 , ξ ( r 2 ) = 3 ,
  • E 3 n H = r 1 r 2 E H ξ ( r 1 ) = 3 , ξ ( r 2 ) = n ,
  • E n n H = r 1 r 2 E H ξ ( r 1 ) = n , ξ ( r 2 ) = n .
 ☐
These three partitions of the edge set correspond to their degree sum of neighbors of end vertices. The number of edges in E 33 H are 4 n , in E 3 n H G there are n, and in E n n H there are n 2 n 2 . Now, using Equations (1)–(7), we have:
M 1 ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) + ξ ( r 2 ) , M 1 ( H ) = r 1 r 2 E 33 ( H ) ξ ( r 1 ) + ξ ( r 2 ) + r 1 r 2 E 3 n ( H ) ξ ( r 1 ) + ξ ( r 2 ) + r 1 r 2 E n n ( H ) ξ ( r 1 ) + ξ ( r 2 ) = 6 | E 33 ( H ) | + ( 3 + n ) | E 3 n ( H ) | + 2 n | E n n ( H ) | = 6 ( 4 n ) + ( 3 + n ) ( n ) + 2 n ( n 2 n 2 ) = n 3 + 27 n ,
M 2 ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) × ξ ( r 2 ) , M 2 ( H ) = r 1 r 2 E 33 ( H ) ξ ( r 1 ) × ξ ( r 2 ) + r 1 r 2 E 3 n ( H ) ξ ( r 1 ) × ξ ( r 2 ) + r 1 r 2 E n n ( H ) ξ ( r 1 ) × ξ ( r 2 ) = 9 | E 33 ( H ) | + 3 n | E 3 n ( H ) | + n 2 | E n n ( H ) | = 9 ( 4 n ) + 3 n ( n ) + n 2 ( n 2 n 2 ) = n 4 n 3 + 6 n 2 + 72 n 2 ,
H M ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) + ξ ( r 2 ) 2 , H M ( H ) = r 1 r 2 E 33 ( H ) ξ ( r 1 ) + ξ ( r 2 ) 2 + r 1 r 2 E 3 n ( H ) ξ ( r 1 ) + ξ ( r 2 ) 2 + r 1 r 2 E n n ( H ) ξ ( r 1 ) + ξ ( r 2 ) 2 = 9 | E 33 ( H ) | + ( 3 + n ) 2 | E 3 n ( H ) | + 4 n 2 | E n n ( H ) | = 9 ( 4 n ) + n ( 3 + n ) 2 + 4 n 2 ( n 2 n 2 ) = 2 n 4 n 3 + 6 n 2 + 45 n ,
P M 1 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) + ξ ( r 2 ) ] , P M 1 ( H ) = r 1 r 2 E 33 ( H ) ξ ( r 1 ) + ξ ( r 2 ) × r 1 r 2 E 3 n ( H ) ξ ( r 1 ) + ξ ( r 2 ) × r 1 r 2 E n n ( H ) ξ ( r 1 ) + ξ ( r 2 ) = 6 | E 33 ( H ) | × ( 3 + n ) | E 3 n ( H ) | × 2 n | E 3 ( H ) | = 6 4 n × ( 3 + n ) n × ( 2 n ) ( n 2 n 2 ) ,
P M 2 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) × ξ ( r 2 ) ] , P M 2 ( H ) = r 1 r 2 E 33 ( H ) ξ ( r 1 ) × ξ ( r 2 ) × r 1 r 2 E 3 n ( H ) ξ ( r 1 ) × ξ ( r 2 ) × r 1 r 2 E n n ( H ) ξ ( r 1 ) × ξ ( r 2 ) = 9 | E 33 ( H ) | × ( 3 n ) | E 3 n ( H ) | × ( n 2 ) | E n n ( H ) | = 9 4 n × ( 3 n ) n × n n 2 n ,
M 1 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] , M 1 ( H , x ) = r 1 r 2 E 1 ( H ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] + r 1 r 2 E 3 n ( H ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] + r 1 r 2 E n n ( H ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] = r 1 r 2 E 1 ( H ) x 6 + r 1 r 2 E 2 ( H ) x 3 + n + r 1 r 2 E 3 ( H ) x 2 n = | E 33 ( H ) | x 6 + | E 3 n ( H ) | x 3 + n + | E n n ( H ) | x 2 n = 4 n x 4 + n x 3 + n + ( n 2 n 2 ) x 2 n ,
M 2 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] , M 2 ( H , x ) = r 1 r 2 E 1 ( H ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] + r 1 r 2 E 3 n ( H ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] + r 1 r 2 E n n ( H ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] = r 1 r 2 E 1 ( H ) x 9 + r 1 r 2 E 2 ( H ) x 3 n + r 1 r 2 E 3 ( H ) x n 2 = | E 33 ( H ) | x 9 + | E 3 n ( H ) | x 3 n + + | E n n ( H ) | x n 2 = 4 n x 9 + n x 3 n + ( n 2 n 2 ) x n 2 .
Theorem 3.
Let P n be the line graph of the ladder graph L n of order n. Then,
M 1 ( P n ) = 154 n 76 , M 2 ( P n ) = 81 n 132 , H M ( P n ) = 324 n 524 , P M 1 ( P n ) = 4 6 × 5 4 × 6 ( 9 n 20 ) , P M 2 ( P n ) = 4 6 × 6 4 × 9 ( 9 n 20 ) , M 1 ( P n , x ) = 6 x 4 + 4 x 5 + ( 9 n 20 ) x 6 , M 2 ( P n , x ) = 6 x 4 + 4 x 6 + ( 9 n 20 ) x 9 .
Proof. 
The subdivision diagram of the stepping stool chart L n and the comparing line chart P n appear in Figure 3a,b, respectively. The quantity of vertices in the line chart P n are 6 n 4 , among which 8 vertices are of degree 2 and the rest of the 6 n 12 vertices are of degree 3. It is simple to process that the aggregate number of edges in the line chart P n is 9 n 10 . To demonstrate the above proclamation, the edge set E ( P n ) isolates into three edge parcels in light of the degrees of end vertices:
  • E 22 P n = r 1 r 2 E P n ξ ( r 1 ) = 2 , ξ ( r 2 ) = 2 ,
  • E 23 P n = r 1 r 2 E P n ξ ( r 1 ) = 2 , ξ ( r 2 ) = 3 ,
  • E 33 P n = r 1 r 2 E P n ξ ( r 1 ) = 3 , ξ ( r 2 ) = 3 .
 ☐
These three partitions of the edge set correspond to their degree sum of neighbors of end vertices. The number of edges in E 22 P n are 6, in E 23 P n there are 4, and in E 33 P n there are 9 n 20 . Now, using Equations (1)–(7), we have:
M 1 ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) + ξ ( r 2 ) , M 1 ( P n ) = r 1 r 2 E 22 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) + r 1 r 2 E 23 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) + r 1 r 2 E 33 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) = 4 | E 22 ( P n ) | + 5 | E 23 ( P n ) | + 6 | E 33 ( P n ) | = 4 ( 6 ) + 5 ( 4 ) + 6 ( 9 n 20 ) = 154 n 76 ,
M 2 ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) × ξ ( r 2 ) , M 2 ( P n ) = r 1 r 2 E 22 ( P n ) ξ ( r 1 ) × ξ ( r 2 ) + r 1 r 2 E 23 ( P n ) ξ ( r 1 ) × ξ ( r 2 ) + r 1 r 2 E 33 ( P n ) ξ ( r 1 ) × ξ ( r 2 ) = 4 | E 22 ( P n ) | + 6 | E 23 ( P n ) | + 9 | E 33 ( P n ) | = 4 ( 6 ) + 6 ( 4 ) + 9 ( 9 n 20 ) = 81 n 132 ,
H M ( G ) = r 1 r 2 E ( G ) ξ ( r 1 ) + ξ ( r 2 ) 2 , H M ( P n ) = r 1 r 2 E 22 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) 2 + r 1 r 2 E 23 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) 2 + r 1 r 2 E 33 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) 2 = 16 | E 22 ( P n ) | + 25 | E 23 ( P n ) | + 36 | E 33 ( P n ) | = 16 ( 6 ) + 25 ( 4 ) + 36 ( 9 n 20 ) = 324 n 524 ,
P M 1 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) + ξ ( r 2 ) ] , P M 1 ( P n ) = r 1 r 2 E 22 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) × r 1 r 2 E 23 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) × r 1 r 2 E 33 ( P n ) ξ ( r 1 ) + ξ ( r 2 ) = 4 | E 22 ( P n ) | × 5 | E 23 ( P n ) | × 6 | E 33 ( P n ) | = 4 6 × 5 4 × 6 ( 9 n 20 ) ,
P M 2 ( G ) = r 1 r 2 E ( G ) [ ξ ( r 1 ) × ξ ( r 2 ) ] , P M 2 ( P n ) = r 1 r 2 E 22 ( P n ) ξ ( r 1 ) × ξ ( r 2 ) × r 1 r 2 E 23 ( P n ) ξ ( r 1 ) × ξ ( r 2 ) × r 1 r 2 E 33 ( P n ) ξ ( r 1 ) × ξ ( r 2 ) = 4 | E 22 ( P n ) | × 6 | E 23 ( P n ) | × 9 | E 33 ( P n ) | = 4 6 × 6 4 × 9 ( 9 n 20 ) ,
M 1 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] , M 1 ( P n , x ) = r 1 r 2 E 1 ( P n ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] + r 1 r 2 E 2 ( P n ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] + r 1 r 2 E 3 ( P n ) x [ ξ ( r 1 ) + ξ ( r 2 ) ] = r 1 r 2 E 1 ( P n ) x 4 + r 1 r 2 E 2 ( P n ) x 5 + r 1 r 2 E 3 ( P n ) x 6 = | E 22 ( P n ) | x 4 + | E 23 ( P n ) | x 5 + + | E 33 ( P n ) | x 6 = 6 x 4 + 4 x 5 + ( 9 n 20 ) x 6 ,
M 2 ( G , x ) = r 1 r 2 E ( G ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] , M 2 ( P n , x ) = r 1 r 2 E 1 ( P n ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] + r 1 r 2 E 2 ( P n ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] + r 1 r 2 E 3 ( P n ) x [ ξ ( r 1 ) × ξ ( r 2 ) ] = r 1 r 2 E 1 ( P n ) x 4 + r 1 r 2 E 2 ( P n ) x 6 + r 1 r 2 E 3 ( P n ) x 9 = | E 22 ( P n ) | x 4 + | E 23 ( P n ) | x 6 + + | E 33 ( P n ) | x 9 = 6 x 4 + 4 x 6 + ( 9 n 20 ) x 9 .

4. 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.

Author Contributions

S.I and M.I. contributed to supervision, project administration, and funding, and analyzed the data curation. M.I. and M.K.S. contributed to designing the experiments, validation, conceptualization, formal analysis of experiments, resources, software, and some computations. M.F.N. contributed to investigation and methodology, and wrote the initial draft of the paper (which were investigated and approved by M.K.S.), and wrote the final draft. All authors read and approved the final version of the paper.

Funding

This research is supported by the Start-Up Research Grant 2016 of United Arab Emirates University (UAEU), Al Ain, United Arab Emirates via Grant No. G00002233, UPAR Grant of UAEU via Grant No. G00002590 and by the Summer Undergraduate Research Experience (SURE) plus 2017 research Grant via Grant No. G00002412.

Acknowledgments

The authors are grateful to the anonymous referees for their valuable comments and suggestions that improved this paper.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wiener, H. Structural determination of paraffin boiling points. J. Am. Chem. Soc. 1947, 69, 17–20. [Google Scholar] [CrossRef] [PubMed]
  2. Dobrynin, A.A.; Entringer, R.; Gutman, I. Wiener index of trees: Theory and applications. Acta Appl. Math. 2001, 66, 211–249. [Google Scholar] [CrossRef]
  3. Gutman, I.; Trinajstic, N. Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
  4. Shirdel, G.H.; Reza Pour, H.; Sayadi, A.M. The Hyper Zagreb Index of Graph Operations. Iran. J. Math. Chem. 2013, 42, 213–220. [Google Scholar]
  5. Ghorbani, M.; Azimi, N. Note on multiple Zagreb indices. Iran. J. Math. Chem. 2012, 32, 137–143. [Google Scholar]
  6. Eliasi, M.; Iranmanesh, A.; Gutman, I. Multiplicative version of first Zagreb index. Match Commun. Math. Comput. Chem. 2012, 68, 217–230. [Google Scholar]
  7. Liu, J.B.; Siddiqui, M.K.; Zahid, M.A.; Naeem, M.; Baig, A.Q. Topological Properties of Crystallographic Structure of Molecules. Symmetry 2018, 10, 265. [Google Scholar] [CrossRef]
  8. Shao, Z.; Siddiqui, M.K.; Muhammad, M.H. Computing Zagreb Indices and Zagreb Polynomials for Symmetrical Nanotubes. Symmetry 2018, 10, 244. [Google Scholar] [CrossRef]
  9. Siddiqui, M.K.; Imran, M.; Ahmad, A. On Zagreb indices, Zagreb polynomials of some nanostar dendrimers. Appl. Math. Comput. 2016, 280, 132–139. [Google Scholar] [CrossRef]
  10. Gao, W.; Siddiqui, M.K.; Naeem, M.; Rehman, N.A. Topological Characterization of Carbon Graphite and Crystal Cubic Carbon Structures. Molecules 2017, 22, 1496. [Google Scholar] [CrossRef] [PubMed]
  11. Bača, M.; Horváthová, J.; Mokrišová, M.; Suhányiová, A. On topological indices of fullerenes. Appl. Math. Comput. 2015, 251, 154–161. [Google Scholar] [CrossRef]
  12. Bača, M.; Horváthová, J.; Mokrišová, M.; Semanicová-Fenovcíková, A.; Suhányiová, A. On topological indices of carbon nanotube network. Can. J. Chem. 2015, 93, 1–4. [Google Scholar] [CrossRef]
  13. Gao, W.; Farahani, M.R.; Siddiqui, M.K.; Jamil, M.K. On the First and Second Zagreb and First and Second Hyper-Zagreb Indices of Carbon Nanocones CNCk[n]. J. Comput. Theor. Nanosci. 2016, 13, 7475–7482. [Google Scholar] [CrossRef]
  14. Gao, W.; Farahani, M.R.; Jamil, M.K.; Siddiqui, M.K. The Redefined First, Second and Third Zagreb Indices of Titania Nanotubes TiO2[m,n]. Open Biotechnol. J. 2016, 10, 272–277. [Google Scholar] [CrossRef]
  15. Gao, W.; Siddiqui, M.K.; Imran, M.; Jamil, M.K.; Farahani, M.R. Forgotten Topological Index of Chemical Structure in Drugs. Saudi Pharm. J. 2016, 24, 258–267. [Google Scholar] [CrossRef] [PubMed]
  16. Imran, M.; Hayat, S.; Mailk, M.Y.H. On topological indices of certain interconnection networks. Appl. Math. Comput. 2014, 244, 936–951. [Google Scholar] [CrossRef]
  17. Imran, M.; Siddiqui, M.K.; Naeem, M.; Iqbal, M.A. On Topological Properties of Symmetric Chemical Structures. Symmetry 2018, 10, 173. [Google Scholar] [CrossRef]
  18. Siddiqui, M.K.; Gharibi, W. On Zagreb Indices, Zagreb Polynomials of Mesh Derived Networks. J. Comput. Theor. Nanosci. 2016, 13, 8683–8688. [Google Scholar] [CrossRef]
  19. Siddiqui, M.K.; Naeem, M.; Rahman, N.A.; Imran, M. Computing topological indicesof certain networks. J. Optoelectron. Adv. Mater. 2016, 18, 884–892. [Google Scholar]
  20. Rajan, M.A.; Lokesha, V.; Ranjini, P.S. A Study on Series Edge Graph Transformation. In Proceedings of the 23rd Joint Congress Iran-South Korea Jangjeon Mathematical Society, Ahvaz, Iran, 6–11 February 2010. [Google Scholar]
  21. Ranjini, P.S.; Lokesha, V.; Cangül, I.N. On the Zagreb indices of the line graphs of the subdivision graphs. Appl. Math. Comput. 2011, 218, 699–702. [Google Scholar] [CrossRef]
  22. Ranjini, P.S.; Lokesha, V.; Rajan, M.A. On the Shultz index of the subdivision graphs. Adv. Stud. Contemp. Math. 2011, 213, 279–290. [Google Scholar]
  23. Ali, A.; Iqbal, H.; Nazeer, W.; Kang, S.M. on topological indices for the line graph of firecracker graph. Int. J. Pure Appl. Math. 2017, 116, 103–1042. [Google Scholar]
  24. Sardar, M.S.; Zafar, S.; Zahid, Z. Computing topological indices of the line graphs of Banana tree graph and Firecracker graph. Appl. Math. Nonlinear Sci. 2017, 2, 83–92. [Google Scholar] [CrossRef]
  25. Ahmad, M.S.; Nazeer, W.; Kang, S.M.; Jung, C.Y. M-polynomials and Degree based Topological Indices for the Line Graph of Firecracker Graph. Global J. Pure Appl. Math. 2017, 13, 2749–2776. [Google Scholar]
  26. Soleimani, N.; Mohseni, E.; Rezaei, F.; Khati, F. Some Formulas for the Polynomials and Topological Indices of Nanostructures. Acta Chem. Iasi 2016, 24, 122–138. [Google Scholar] [CrossRef] [Green Version]
  27. Su, G.; Xu, L. Topological indices of the line graph of subdivision graphs and their Schur-bounds. Appl. Math. Comput. 2015, 253, 395–401. [Google Scholar] [CrossRef]
  28. Nadeem, M.F.; Zafar, S.; Zahid, Z. Certain topological indicies of the line graph of subdivsion graphs. Appl. Math. Comput. 2015, 271, 790–794. [Google Scholar]
  29. Nadeem, M.F.; Zafar, S.; Zahid, Z. On topological properties of the line graphs of subdivision graphs of certain nanostructures. Appl. Math. Comput. 2016, 273, 125–130. [Google Scholar] [CrossRef]
Figure 1. (a) Subdivision graph of the tadpole graph T n , k ; (b) Line graph of the subdivision graph of ( T n , k ) .
Figure 1. (a) Subdivision graph of the tadpole graph T n , k ; (b) Line graph of the subdivision graph of ( T n , k ) .
Mathematics 06 00137 g001
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 2. (a) Subdivision graph of wheel graph W n + 1 ; (b) Line graph of the subdivision graph of the wheel graph W n + 1 .
Mathematics 06 00137 g002
Figure 3. (a) Subdivision graph of the ladder graph L n ; (b) Line graph of the subdivision graph of the ladder graph L n .
Figure 3. (a) Subdivision graph of the ladder graph L n ; (b) Line graph of the subdivision graph of the ladder graph L n .
Mathematics 06 00137 g003

Share and Cite

MDPI and ACS Style

Imran, S.; Siddiqui, M.K.; Imran, M.; Nadeem, M.F. Computing Topological Indices and Polynomials for Line Graphs. Mathematics 2018, 6, 137. https://doi.org/10.3390/math6080137

AMA Style

Imran S, Siddiqui MK, Imran M, Nadeem MF. Computing Topological Indices and Polynomials for Line Graphs. Mathematics. 2018; 6(8):137. https://doi.org/10.3390/math6080137

Chicago/Turabian Style

Imran, Shahid, Muhammad Kamran Siddiqui, Muhammad Imran, and Muhammad Faisal Nadeem. 2018. "Computing Topological Indices and Polynomials for Line Graphs" Mathematics 6, no. 8: 137. https://doi.org/10.3390/math6080137

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop