The Maximal ABC Index of the Corona of Two Graphs
Let G1∘G2 be the corona of two graphs G1 and G2 which is the graph obtained by taking one copy of G1 and VG1 copies of G2 and then joining the ith vertex of G1 to every vertex in the i th copy of G2. The atom-bond connectivity index (ABC index) of a graph G is defined as ABCG=∑uv∈EGdGu+dGv−2/dGudGv,...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2021-01-01
|
| Series: | Mathematical Problems in Engineering |
| Online Access: | http://dx.doi.org/10.1155/2021/6699529 |