On the Graovc-Ghorbani and Atom-Bond Connectivity Indices of Graphs from Primary Subgraphs
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Let G=(V,E) be a finite simple graph. The Graovac-Ghorbani index of a graph G is defined as ABCGG(G)=∑uv∈E(G) √((nu(uv,G)+nv(uv,G)-2)/(nu(uv,G)nv(uv,G))), where nu(uv,G) is the number of vertices closer to vertex u than vertex v of the edge uv∈E(G). nv(uv,G) is defined analogously. The atom-bond connectivity index of a graph G is defined as ABC(G)=∑uv∈E(G)√((du+dv-2)(dudv)), where du is the degree of vertex u in G. Let G be a connected graph constructed from pairwise disjoint connected graphs G1,...,Gk by selecting a vertex of G1, a vertex of G2, and identifying these two vertices. Then continue in this manner inductively. We say that G is obtained by point-attaching from G1,...,Gk and that Gi 's are the primary subgraphs of G. 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:
Language:
English
Published:
Iranian Journal of Mathematical Chemistry, Volume:13 Issue: 1, Winter 2022
Pages:
45 to 72
magiran.com/p2464831
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یکساله به مبلغ 1,390,000ريال میتوانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
- حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران میشود.
- پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانههای چاپی و دیجیتال را به کاربر نمیدهد.
In order to view content subscription is required
Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!