Next Article in Journal
Prešić Type Nonself Operators and Related Best Proximity Results
Previous Article in Journal
Common Fixed Point Results for Rational (α,β)φ- Contractions in Complete Quasi Metric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Computing Certain Topological Indices of the Line Graphs of Subdivision Graphs of Some Rooted Product Graphs

1
Department of Natural Sciences and Humanities, University of Engineering and Technology, Lahore 54000, Pakistan
2
Department of Mathematics, COMSAT University Islamabad, Lahore 54000, Pakistan
3
University of Management and Technology (UMT), Lahore 54000, Pakistan
4
School of Information Science and Technology, Yunnan Normal University, Kunming 650500, China
*
Author to whom correspondence should be addressed.
Submission received: 6 April 2019 / Revised: 25 April 2019 / Accepted: 26 April 2019 / Published: 30 April 2019

Abstract

:
In this work, we study the degree-based topological invariants, and the general sum-connectivity, A B C 4 , G A 5 , general Zagreb, G A , generalized Randić, and A B C indices of the line graphs of some rooted product graphs ( C n { P k } and C n { S m + 1 } ) are determined by menas of the concept of subdivision. Moreover, we also computed all these indices of the line graphs of the subdivision graphs of i-th vertex rooted product graph C i , r { P k + 1 } .

1. Introduction

All graphs discussed in this paper are simple and connected. Let G be a (molecular) graph with vertex set V ( G ) and edge set E ( G ) , respectively. For a vertex u V ( G ) , we denote N u = { v : u v E ( G ) } , d u = | N u | (degree of u) and S u = v N u d v . The subdivision of an edge u v in a graph G is deduced by inserting a new vertex w in V ( G ) , and in edge set E ( G ) the edge u v is replaced by two new edges u w and w v . In this way, the subdivision graph S ( G ) results from the subdivision of all the edges of G. The line graph L ( G ) of a graph G is the graph with V ( L ( E ) ) = E ( G ) , and e 1 e 2 E ( L ( G ) ) if and only if e 1 and e 2 share a common endpoint in G. The L ( S ( G ) ) is the line graph of S ( G ) .
The first degree-based topological index dates back to 1975, which is called the Randić index. The general Randić connectivity index [1] of graph G can be formulated by
R α ( G ) = u v E ( G ) ( d u d v ) α ,
where α R (in what follows, α always denoted as a real number), and R 1 / 2 ( G ) is well known as Randić connectivity index of graph G.
Li and Zhao [2] introduced the first general Zagreb index which is stated as
M α ( G ) = u V ( G ) ( d u ) α .
The general version of sum-connectivity index χ α ( G ) has been introduced in 2010 [3], which is defined as
χ α ( G ) = u v E ( G ) ( d u + d v ) α .
Estrada et al. [4] defined the atom-bond connectivity (ABC) index which was widely studied by researchers in the recent 10 years. For a graph G, its A B C index is expressed by
A B C ( G ) = u v E ( G ) d u + d v 2 d u d v .
The fourth A B C index (denoted by A B C 4 , as a neighborhood degree-based analog invariant) was introduced by Ghorbani et al. in [5], which is stated as
A B C 4 ( G ) = u v E ( G ) S u + S v 2 S u S v .
Vukicevic and Furtula [6] introduced the geometric arithmetic (GA) index and defined it as
G A ( G ) = u v E ( G ) 2 d u d v d u + d v .
A variant of GA index, the so-call the fifth G A index ( G A 5 ) , is proposed by Graovac et al. [7] as
G A 5 ( G ) = u v E ( G ) 2 S u S v S u + S v .
For more recent contributions on the topological indices of graphs in different settings the readers may refer to [8,9,10,11,12,13,14,15,16,17,18,19,20].
Ranjini et al. [21] presented the exact values of the Shultz index of the subdivision graph of the wheel, tadpole, ladder, and helm graphs. The Zagreb indices of the line graph with subdivision of these structure are studied in [17]. In light of graph structure analysis, Su and Xu [22] computed the general sum-connectivity index and co-index of the line graph of these graphs with subdivision. Nadeem et al. [23] determined A B C 4 and G A 5 indices of the line graph of the wheel, ladder, and tadpole graphs by means of the definition of subdivision.
The strategies we used in our computations are: combinatorial registering, vertex partition procedure, edge partition technique, and degree-counting schemes. Furthermore, with the help of vertex and edge partitions, we compute various degree-based indices. In addition, we use Maple for calculations.
This paper is structured as follows. In next section, we yield a close formula of general Randić index, general sum connectivity index, general zagreb index, A B C , A B C 4 , G A , and G A 5 indices for L ( S ( G ) ) , where G is certain rooted product graph. We define the i-th vertex rooted product of graphs and study the topological indices for L ( S ( G ) ) , where G is a family of i-th vertex rooted product of graphs in Section 3. Some remarks are presented in the concluding section.

2. Topological Indices of Line Graph of the Subdivision Graph of Rooted Product of Graphs

Let H be a labeled graph with vertex set V ( H ) = { 1 , 2 , , n } and G be a sequence of n rooted graphs G 1 , G 2 , , G n . Godsil and Mckay [24] defined the rooted product of H by G, i.e., H ( G ) = H ( G 1 , G 2 , , G n ) is a graph yielded by identifying the root vertex of G i with the i-th vertex of H for all i { 1 , 2 , , n } . In particular, if the components G i ( i { 1 , 2 , , n } ) are mutually isomorphic to K, then the rooted product of H by G is denoted by H { K } , which is the so-called cluster product of H by K.

2.1. Topological Indices of Line Graph of the Subdivision Graph of C n { P k }

Let P n and C n denotes the path and cycle with order n. Let C n { P k + 1 } be the cluster product of cycle of length n with a path of length k. The graph of C n { P k + 1 } is shown in Figure 1. It clearly shows that the number of vertices and number of edges in C n { P k + 1 } are both n + n k . In the next theorem we will compute the general Zagreb index of the line graph of subdivision graph of C n { P k + 1 } .
Theorem 1.
Let G be a graph isomorphic to the line graph of the subdivision graph of C n { P k + 1 } . Then M α ( G ) = n + ( n k n ) 2 α + 1 + n · ( 3 ) α + 1 .
Proof. 
The structure of G is shown in Figure 1. There are total 2 n + 2 n k vertices among which the number of vertices of degree 1, 2, and 3 are n, 2 n k 2 n , and 3 n , respectively. Thus, M α ( G ) is obtained in terms of Equation (2). □
Theorem 2.
Let G be a graph isomorphic to the line graph of the subdivision graph of C n { P k + 1 } . Then
1.
R α ( G ) = n · 3 α + 4 n · 3 2 α , i f k = 1 ; n · 2 α + ( 2 n k 3 n ) 4 α + n · 6 α + 4 n · 3 2 α , i f k > 1 .
2.
χ α ( G ) = n · 4 α + 4 n · 6 α , i f k = 1 ; n · 3 α + ( 2 n k 3 n ) 4 α + n · 5 α + 4 n · 6 α , i f k > 1 .
3.
A B C ( G ) = 1 3 6 + 8 3 n , i f k = 1 ; 2 2 + 8 3 n + n k 2 , i f k > 1 .
4.
G A ( G ) = 1 2 3 + 4 n , i f k = 1 ; 2 3 2 + 1 + 2 5 6 n + 2 n k , i f k > 1 .
Proof. 
It is easily seen that | E ( G ) | = 3 n + 2 k n . The edge partitions, based on the degrees of the vertices for the cases k = 1 and k > 1 , are shown in Table 1 and Table 2, respectively. In view of (1), (3), (4), and (6), we infer the required conclusions. □
Theorem 3.
Let G be a graph isomorphic to the line graph of the subdivision graph of C n { P k + 1 } . Then
1.
A B C 4 ( G ) =
2 21 42 + 2 3 2 + 8 9 n , i f k = 1 ; 1 2 2 + 1 5 10 + 1 20 110 + 1 6 30 + 8 9 n , i f k = 2 ; 1 2 6 n k + n 1 2 2 + 1 6 15 5 4 6 + 8 9 + 1 10 35 + 1 20 110 + 1 6 30 , i f k > 2 .
2.
G A 5 ( G ) =
1 5 21 + 3 4 7 + 2 n , i f k = 1 ; 2 5 6 + 1 4 15 + 4 13 10 + 24 17 2 + 2 n , i f k = 2 ; 2 5 6 + 4 7 3 + 24 17 2 3 + 4 9 5 + 4 13 10 n + 2 k n , i f k > 2 .
Proof. 
The edge partitions, according to the degree sum of neighbor vertices of every vertex for the cases k = 1 , k = 2 , and k > 2 , are shown in Table 3, Table 4 and Table 5, respectively. Using Equations (5) and (7), we obtain the required results. □

2.2. Topological Indices of Line Graph of the Subdivision Graph of C n { S m + 1 }

Let S m + 1 be star graph on m + 2 vertices. The cluster product of C n by S m + 1 , denoted by C n { S m + 1 } , is obtained by identifying any pendent vertex of the i-th copy of S m + 1 to the i-th vertex of C n . It is easy to see that there are m n + 2 n vertices and edges in C n { S m + 1 } . The graph of C n { S m + 1 } is shown in Figure 2.
Theorem 4.
Let G be a graph isomorphic to the line graph of the subdivision graph of C n { S m + 1 } . Then M α ( G ) = m n + n · 3 α + 1 + n ( m + 1 ) α + 1 .
Proof. 
The structure of G is manifested in Figure 2. There is a total 2 m n + 4 n vertices among which the number of vertices with degree 1, 3, and m + 1 are m n , 3 n , and m n + n , respectively. Thus, the expression of M α ( G ) is deduced by means of (2). □
Theorem 5.
Let G be a graph isomorphic to the line graph of the subdivision graph of C n { S m + 1 } . Then
1.
R α ( G ) = m n ( m + 1 ) α + n ( 3 m + 3 ) α + 4 n · 9 α + m n 2 ( m + 1 ) 2 α + 1 .
2.
χ α ( G ) = m n ( m + 2 ) α + n ( m + 4 ) α + 4 n · 6 α + m n ( m + 1 ) 2 ( 2 m + 2 ) α .
3.
A B C ( G ) = m n m m + 1 + n 3 2 + m m + 1 + 8 n 3 + m n m 2 .
4.
G A ( G ) = 2 m n m + 1 2 + m + 2 n 3 m + 3 4 + m + 4 n + m n m + 1 2 .
Proof. 
It is noted that there are 1 2 ( m 2 n + 3 m n + 10 n ) edges in G. Its edge partition, follow from the degrees of the vertices are depicted in Table 6. From (1), (3), (4), and (6), we get the required results. □
Theorem 6.
Let G be a graph isomorphic to the line graph of the subdivision graph of C n { S m + 1 } and let β = m 2 + m + 1 . Then
1.
A B C 4 ( G ) = m n m 1 + β m + 1 β + m n m 1 2 β 2 2 β + m n 2 1 β + 2 + n β + 7 + m β + 2 m + 7 + 2 n 3 m + 14 m + 7 + 8 n 9 .
2.
G A 5 ( G ) = 2 m n m + 1 β m + 1 + β + m n m 1 2 + 2 m n β β + 2 2 β + 2 + 2 n β + 2 m + 7 β + 9 + m + 12 n m + 7 m + 16 + 2 n .
Proof. 
The edge partitions, in light of the neighborhood analysis and degree calculation are presented in Table 7. From Equations (5) and (7), we obtain the required results. □

3. i -th Vertex Rooted Product of Graphs

Motivated by the definition of rooted product of graphs, we define the i-th vertex rooted product of graphs. Let H be a labeled graph with order n and G be a sequence of k rooted graphs G 1 , G 2 , , G k . Then the i-th vertex rooted product of H by G, denoted by H i { G 1 , G 2 , , G k } is generated by identifying the root vertex of every G l to the i-th vertex of H for all l { 1 , 2 , , k } . In the special case when the components G 1 , G 2 , , G k are mutually isomorphic to a graph L, the i-th vertex rooted product of H by G is denoted by H i , k { L } and so-called the i-th vertex cluster product of H by L.

Topological Indices of Line Graph of the Subdivision Graph of C i , r { P k + 1 }

Let C = C n be cycle on n vertices and let C i , r { P k + 1 } be the i-th vertex cluster product of C n by P k + 1 , where P k + 1 is a path on k + 1 vertices. Obviously, there are n + k r vertices and edges in C i , r { P k + 1 } . The graph of C i , r { P k + 1 } is shown in Figure 3.
Theorem 7.
Let G be a graph isomorphic to the line graph of the subdivision graph of C i , r { P k + 1 } . Then M α ( G ) = r + ( n + k r r 2 ) 2 α + 1 + ( r + 2 ) α + 1 .
Proof. 
The basic structure of G is depicted in Figure 3. There are in total 2 n + 2 k r vertices, among which r vertices meet degree 1, 2 n + 2 k r 2 r 2 vertices have degree 2, and the remaining r + 2 vertices satisfy degree r + 2 . Therefore, the fomula for M α ( G ) is got in terms of (2). □
Theorem 8.
Let G be a graph isomorphic to the line graph of the subdivision graph of C i , r { P k + 1 } . Then
1.
R α ( G ) =
r · ( r + 2 ) α + ( 2 n 3 ) 4 α + 2 · ( 2 r + 4 ) α + 1 2 ( r 2 + 3 r + 2 ) ( r + 2 ) 2 α , i f k = 1 ; r · 2 α + ( 2 n + 2 k r 3 r 3 ) 4 α + ( r + 2 ) ( 2 r + 4 ) α + 1 2 ( r 2 + 3 r + 2 ) ( r + 2 ) 2 α , i f k > 1 .
2.
χ α ( G ) =
r · ( r + 3 ) α + ( 2 n 3 ) 4 α + 2 · ( r + 4 ) α + 1 2 ( r 2 + 3 r + 2 ) ( 2 r + 4 ) α , i f k = 1 ; r · 3 α + ( 2 n + 2 k r 3 r 3 ) 4 α + ( r + 2 ) ( r + 4 ) α + 1 2 ( r 2 + 3 r + 2 ) ( 2 r + 4 ) α , i f k > 1 .
3.
A B C ( G ) = r 1 + r r + 2 + 1 2 2 n 3 2 + 2 + 1 2 r + 1 2 r + 2 , i f k = 1 ; r 2 + 2 k r + 2 n 3 r 3 2 + r + 2 2 + 1 2 1 + r 2 r + 2 , i f k > 1 .
4.
G A ( G ) = 2 r r + 2 3 + r + 2 n 3 + 4 2 r + 4 4 + r + r 2 + 3 r + 2 2 , i f k = 1 ; 2 3 r 2 + 2 k r + 2 n 3 r 3 + 2 r + 2 2 r + 4 4 + r + r 2 + 3 r + 2 2 , i f k > 1 .
Proof. 
By simple calculation the total number of edges of G are 1 2 ( 4 n + r 2 + 4 k r + r ) . The edge partitions, using the degrees of the vertices for the cases k = 1 and k > 1 , are shown in Table 8 and Table 9, respectively. Equations (1), (3), (4), and (6) implies the required results. □
Theorem 9.
Let G be a graph isomorphic to the line graph of the subdivision graph of C i , r { P k + 1 } and let t = r 2 + 3 r + 3 . Then
1.
A B C 4 ( G ) =
r r + t r + 2 t + 1 2 r 2 r 2 t 2 t + 2 r 2 t 1 t t + 1 + 2 t t + 1 + 2 r + 3 + t r + 4 t + 1 + 6 + r r + 4 + 1 4 2 n 5 6 , i f k = 1 ; r 2 + r 3 r + 5 r + 4 + 6 + r r + 4 + r + 2 r + 3 + t r + 4 t + 1 + t 1 t 2 t + 1 + 1 4 2 n 5 6 , i f k = 2 ; r 2 + 1 6 15 r + 1 2 r + 2 6 + r r + 4 + t 1 t 2 t + 1 + r + 2 r + 3 + t r + 4 t + 1 + 1 4 2 k r + 2 n 5 r 5 6 , i f k > 2 .
2.
G A 5 ( G ) =
2 r r + 2 t r + 2 + t + r 2 r 2 + 4 r t t + 1 2 t + 1 + 4 r + 4 t + 1 r + 5 + t + 8 r + 4 8 + r + 2 n 4 , i f k = 1 ; 2 5 r 6 + 2 r 3 r + 12 7 + r + 8 r + 4 8 + r + 2 r + 2 r + 4 t + 1 r + 5 + t + 1 2 t 11 2 + 2 n , i f k = 2 ; 2 5 r 6 + 4 7 3 r + 4 r + 2 r + 4 8 + r + 1 2 t 11 2 + 2 r + 2 r + 4 t + 1 r + 5 + t + 2 k r + 2 n 5 r , i f k > 2 .
Proof. 
For t = r 2 + 3 r + 3 , the edge partitions, in view of neighborhood analysis and degree calculation of each vertex for the case k = 1 , k = 2 , and k > 2 , are shown in Table 10, Table 11 and Table 12, respectively. From Equations (5) and (7), we obtain the required results. □

4. Conclusions

In this article, certain degree-based topological invariants, namely general sum-connectivity index, A B C 4 , generalized Randić index, G A 5 , and general Zagreb index for the line graphs of subdivision graphs of some classes of rooted product of graphs were studied for the first time. We have also constructed a new class of rooted product of graphs called i-th vertex rooted product of graph G by using the same concept of identifying the root vertex of sequence of graphs with the i-th vertex of G. Finally, in the last section we have computed the topological indices of the line graph of subdivision graph ith vertex cluster product of cycle of length r with path of length k.

Author Contributions

All the authors contributed equally.

Funding

This contribution was supported by NSFC (no. 11761083).

Conflicts of Interest

We claim that there is no conflict of interest.

References

  1. Bollobas, B.; Erdos, P. Graphs of extremal weights. Ars Combin. 1998, 50, 225–233. [Google Scholar] [CrossRef]
  2. Li, X.; Zhao, H. Trees with the first three smallest and largest generalized topological indices. MATCH Commun. Math. Comput. Chem. 2004, 50, 57–62. [Google Scholar]
  3. Zhou, B.; Trinajstić, N. On general sum-connectivity index. J. Math. Chem. 2010, 47, 210–218. [Google Scholar] [CrossRef]
  4. Estrada, E.; Torres, L.; Rodriguez, L.; Gutman, I. An atom-bond connectivity index: Modelling the enthalpy of formation of alkanes. Indian J. Chem. 1998, 37, 849–855. [Google Scholar]
  5. Ghorbani, M.; Hosseinzadeh, M.A. Computing ABC4 index of nanostar dendrimers. Optoelectron. Adv. Mater.-Rapid Commun. 2010, 4, 1419–1422. [Google Scholar]
  6. Vukicević, D.; Furtula, B. Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges. J. Math. Chem. 2009, 46, 1369–1376. [Google Scholar] [CrossRef]
  7. Graovać, A.; Ghorbani, M.; Hosseinzadeh, M.A. Computing fifth geometric-arithmetic index for nanostar dendrimers. J. Math. Nanosci. 2011, 1, 33–42. [Google Scholar]
  8. Aslam, A.; Bashir, Y.; Ahmad, S.; Gao, W. On topological indices of certain dendrimer structures. Z. Naturforsch. 2017, 72, 559–566. [Google Scholar] [CrossRef]
  9. Aslam, A.; Ahmad, S.; Gao, W. On certain topological indices of boron triangular nanotubes. Z. Naturforsch. 2017, 72, 711–716. [Google Scholar] [CrossRef]
  10. Aslam, A.; Jamil, M.K.; Gao, W.; Nazeer, W. Topological aspects of some dendrimer structures. Nanotechnol. Rev. 2018, 7, 123–128. [Google Scholar] [CrossRef]
  11. Aslam, A.; Bashir, Y.; Rafiq, M.; Haider, F.; Muhammad, N.; Bibi, N. Three new/old vertex-degree-based topological indices of some dendrimers structure. Electron. J. Biol. 2017, 13, 94–99. [Google Scholar]
  12. Chen, J.; Liu, J.; Guo, X. Some upper bounds for the atom-bond connectivity index of graphs. Appl. Math. Lett. 2012, 25, 1077–1081. [Google Scholar] [CrossRef]
  13. Das, K.C.; Gutman, I.; Furtula, B. On atom-bond connectivity index. Chem. Phys. Lett. 2011, 511, 452–454. [Google Scholar] [CrossRef]
  14. Das, K.C.; Sorgun, S. On Randić energy of graphs. MATCH Commun. Math. Comput. Chem. 2014, 72, 227–238. [Google Scholar]
  15. Li, X.; Shi, Y.; Wang, L. An updated survey on the Randić index. In Recent Results in the Theory of Randić Index; Gutman, I., Furtula, B., Eds.; University of Kragujevac: Kragujevac, Serbia, 2008; pp. 9–47. [Google Scholar]
  16. Nadeem, M.F.; Zafar, S.; Zahid, Z. On Topological properties of the line graph of subdivision graphs of certain nanostructures. Appl. Math. Comput. 2016, 273, 125–130. [Google Scholar] [CrossRef]
  17. Ranjini, P.S.; Lokesha, V.; Cangul, I.N. On the Zagreb indices of the line graphs of the subdivision graphs. Appl. Math. Comput. 2011, 218, 699–702. [Google Scholar] [CrossRef]
  18. Knor, M.; Škrekovski, R.; Tepeh, A. Convexity result and trees with large Balaban index. Appl. Math. Nonl. Sci. 2018, 3, 433–446. [Google Scholar] [CrossRef]
  19. Liu, D.L.; Wang, C.X.; Wang, S.H. Hamilton-connectivity of interconnection networks modeled by a product of graphs. Appl. Math. Nonl. Sci. 2018, 3, 419–426. [Google Scholar] [CrossRef]
  20. Virk, A.R.; Quraish, M. Some invariants of flower graph. Appl. Math. Nonl. Sci. 2018, 3, 427–432. [Google Scholar] [CrossRef]
  21. Ranjini, P.S.; Lokesha, V.; Rajan, M.A. On the Shultz index of the subdivision graphs. Adv. Stud. Contemp. Math. 2011, 21, 279–290. [Google Scholar]
  22. 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]
  23. 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]
  24. Godsil, C.D.; McKay, B.D. A new graph product and its spectrum. Bull. Austral. Math. Soc. 1978, 18, 21–28. [Google Scholar] [CrossRef]
Figure 1. The graph of C n { P k } ; Line graph of the subdivision graph of C n { P k } .
Figure 1. The graph of C n { P k } ; Line graph of the subdivision graph of C n { P k } .
Mathematics 07 00393 g001
Figure 2. The graph of C n { S m + 1 } ; Line graph of the subdivision graph of C n { S m + 1 } .
Figure 2. The graph of C n { S m + 1 } ; Line graph of the subdivision graph of C n { S m + 1 } .
Mathematics 07 00393 g002
Figure 3. The graph of C i , r { P k + 1 } .
Figure 3. The graph of C i , r { P k + 1 } .
Mathematics 07 00393 g003
Table 1. The edge partition of the graph G for k = 1 .
Table 1. The edge partition of the graph G for k = 1 .
( d u , d v ) where u v E ( G ) (1,3)(3,3)
Number of edgesn4n
Table 2. The edge partition of the graph G for k > 1 .
Table 2. The edge partition of the graph G for k > 1 .
( d u , d v ) where u v E ( G ) (1,2)(2,2)(2,3)(3,3)
Number of edgesn 2 n k 3 n n 4 n
Table 3. The edge partition of the graph G for k = 1 .
Table 3. The edge partition of the graph G for k = 1 .
( S u , S v ) where u v E ( G ) (3,7)(7,9)(9,9)
Number of edgesn2n2n
Table 4. The edge partition of the graph G for k = 2 .
Table 4. The edge partition of the graph G for k = 2 .
( S u , S v ) where u v E ( G ) (2,3)(3,5)(5,8)(8,9)(9,9)
Number of edgesnnn2n2n
Table 5. The edge partition of the graph G for k > 2 .
Table 5. The edge partition of the graph G for k > 2 .
( S u , S v ) where u v E ( G ) (2,3)(3,4)(4,4)(4,5)(5,8)(8,9)(9,9)
Number of edgesnn 2 k n 5 n nn2n2n
Table 6. The edge partition of the graph G.
Table 6. The edge partition of the graph G.
( d u , d v ) where u v E ( G ) (1, m + 1)(3, m + 1)(3,3)(m + 1, m + 1)
Number of edges m n n4n m n ( m + 1 ) 2
Table 7. The edge partition of the graph G.
Table 7. The edge partition of the graph G.
( S u , S v ) where u v E ( G ) ( m + 1 , β ) ( β , β ) ( β , β + 2 ) ( β + 2 , m + 7 ) ( m + 7 , 9 ) (9,9)
Number of edges m n m n ( m 1 ) 2 m n n 2 n 2 n
Table 8. The edge partition of the graph G for k = 1 .
Table 8. The edge partition of the graph G for k = 1 .
( d u , d v ) where u v E ( G ) ( 1 , r + 2 ) ( 2 , 2 ) ( 2 , r + 2 ) ( r + 2 , r + 2 )
Number of edgesr 2 n 3 2 1 2 ( r 2 + 3 r + 2 )
Table 9. The edge partition of the graph G for k > 1 .
Table 9. The edge partition of the graph G for k > 1 .
( d u , d v ) where u v E ( G ) ( 1 , 2 ) ( 2 , 2 ) ( 2 , r + 2 ) ( r + 2 , r + 2 )
Number of edgesr 2 n + 2 k r 3 r 3 r + 2 1 2 ( r 2 + 3 r + 2 )
Table 10. The edge partition of the graph G for k = 1 .
Table 10. The edge partition of the graph G for k = 1 .
( S u , S v ) where u v E ( G ) ( r + 2 , t ) ( t , t ) ( t , t + 1 ) ( t + 1 , t + 1 ) ( r + 4 , t + 1 ) ( 4 , r + 4 ) ( 4 , 4 )
Number of edgesr 1 2 ( r 2 r ) 2r122 2 n 5
Table 11. The edge partition of the graph G for k = 2 .
Table 11. The edge partition of the graph G for k = 2 .
( S u , S v ) where u v E ( G ) ( 2 , 3 ) ( 3 , r + 4 ) ( 4 , r + 4 ) ( r + 4 , t + 1 ) ( t + 1 , t + 1 ) ( 4 , 4 )
Number of edgesrr2 r + 2 1 2 ( t 1 ) 2 n 5
Table 12. The edge partition of the graph G for k > 2 .
Table 12. The edge partition of the graph G for k > 2 .
( S u , S v ) where u v E ( G ) ( 4 , r + 4 ) ( t + 1 , t + 1 ) ( r + 4 , t + 1 ) ( 2 , 3 ) ( 3 , 4 ) ( 4 , 4 )
Number of edges r + 2 1 2 ( t 1 ) r + 2 rr 2 n 5 + 2 k r 5 r

Share and Cite

MDPI and ACS Style

Aslam, A.; Nadeem, M.F.; Zahid, Z.; Zafar, S.; Gao, W. Computing Certain Topological Indices of the Line Graphs of Subdivision Graphs of Some Rooted Product Graphs. Mathematics 2019, 7, 393. https://0-doi-org.brum.beds.ac.uk/10.3390/math7050393

AMA Style

Aslam A, Nadeem MF, Zahid Z, Zafar S, Gao W. Computing Certain Topological Indices of the Line Graphs of Subdivision Graphs of Some Rooted Product Graphs. Mathematics. 2019; 7(5):393. https://0-doi-org.brum.beds.ac.uk/10.3390/math7050393

Chicago/Turabian Style

Aslam, Adnan, Muhammad Faisal Nadeem, Zohaib Zahid, Sohail Zafar, and Wei Gao. 2019. "Computing Certain Topological Indices of the Line Graphs of Subdivision Graphs of Some Rooted Product Graphs" Mathematics 7, no. 5: 393. https://0-doi-org.brum.beds.ac.uk/10.3390/math7050393

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