English

On the Graovac-Ghorbani and atom-bond connectivity indices of graphs from primary subgraphs

Combinatorics 2022-02-07 v2

Abstract

Let G=(V,E)G=(V,E) be a finite simple graph. The Graovac-Ghorbani index of a graph G is defined as ABCGG(G)=uvE(G)nu(uv,G)+nv(uv,G)2nu(uv,G)nv(uv,G),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)}}, where nu(uv,G)n_u(uv,G) is the number of vertices closer to vertex uu than vertex vv of the edge uvE(G)uv\in E(G). nv(uv,G)n_v(uv,G) is defined analogously. The atom-bond connectivity index of a graph G is defined as ABC(G)=uvE(G)du+dv2dudv,ABC(G)=\sum_{uv\in E(G)}\sqrt{\frac{d_u+d_v-2}{d_ud_v}}, where dud_u is the degree of vertex uu in GG. Let GG be a connected graph constructed from pairwise disjoint connected graphs G1,,GkG_1,\ldots ,G_k by selecting a vertex of G1G_1, a vertex of G2G_2, and identifying these two vertices. Then continue in this manner inductively. We say that GG is obtained by point-attaching from G1,,GkG_1, \ldots ,G_k and that GiG_i's are the primary subgraphs of GG. 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.

Keywords

Cite

@article{arxiv.2109.13564,
  title  = {On the Graovac-Ghorbani and atom-bond connectivity indices of graphs from primary subgraphs},
  author = {Nima Ghanbari},
  journal= {arXiv preprint arXiv:2109.13564},
  year   = {2022}
}

Comments

31 pages, 23 figures. arXiv admin note: substantial text overlap with arXiv:2106.06562, arXiv:2103.13663