Let be a finite simple graph. The Graovac-Ghorbani index of a graph G is defined as $ABC_{GG}(G)=\sum_{uv\in E(G)}\sqrt{\frac{n_u(uv,G)+n_v(uv,G)-2}{n_u(uv,G)n_v(uv,G)}},n_u(uv,G)uv$ of the edge . is defined analogously. The atom-bond connectivity index of a graph G is defined as $ABC(G)=\sum_{uv\in E(G)}\sqrt{\frac{d_u+d_v-2}{d_ud_v}},d_uuGG$ be a connected graph constructed from pairwise disjoint connected graphs by selecting a vertex of , a vertex of , and identifying these two vertices. Then continue in this manner inductively. We say that is obtained by point-attaching from $G_1, \ldots ,G_kG_iG$. In this paper, we give some lower and upper bounds on Graovac-Ghorbani and atom-bond connectivity indices for these graphs. Additionally, we consider some particular cases of these graphs that are of importance in chemistry and study their Graovac-Ghorbani and atom-bond connectivity indices.

生成讲解博客的中文版本

生成AI智能校验的中文版本