Sharp Bounds of First Zagreb Coindex for F-Sum Graphs
Let G=VE,EG be a connected graph with vertex set VG and edge set EG. For a graph G, the graphs S(G), R(G), Q(G), and T(G) are obtained by applying the four subdivisions related operations S, R, Q, and T, respectively. Further, for two connected graphs G1 and G2, G1+FG2 are F-sum graphs which are con...
Saved in:
| Main Authors: | Muhammad Javaid, Muhammad Ibraheem, Uzma Ahmad, Jia-Bao Liu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2021/9984412 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computing Bounds for General Randic Coindex of Sum Graphs
by: Muhammad Javaid, et al.
Published: (2021-01-01) -
Bounds on General Randić Index for F-Sum Graphs
by: Xu Li, et al.
Published: (2020-01-01) -
First General Zagreb Co-Index of Graphs under Operations
by: Muhammad Javaid, et al.
Published: (2022-01-01) -
Sharp Bounds for the General Sum-Connectivity Indices of Transformation Graphs
by: Haiying Wang, et al.
Published: (2017-01-01) -
The Second Hyper-Zagreb Coindex of Chemical Graphs and Some Applications
by: Ahmed Ayache, et al.
Published: (2021-01-01)