On Bicyclic Graphs with Maximal Graovac-Ghorbani Index

IF 2.9 2区化学 Q2 CHEMISTRY, MULTIDISCIPLINARY

Match-Communications in Mathematical and in Computer Chemistry Pub Date : 2023-10-01 DOI:10.46793/match.91-2.513s

Rui Song, Saihua Liu, Jianping Ou, Jianbin Cui

引用次数: 0

Abstract

Graovac-Ghorbani index is a new version of the atom-bond connectivity index. D. Pacheco et al. [MATCH Commun. Math. Comput. Chem. 86 (2021) 429-448] conjectured a sharp lower and upper bounds to the Graovac-Ghorbani index for all bicyclic graphs. Motivated by their nice work, in this paper we determine the maximal Graovac-Ghorbani index of bicyclic graphs and characterize the corresponding extremal graphs, which solves one of their Conjectures.

查看原文本刊更多论文

具有极大Graovac-Ghorbani指数的双环图

graovacc - ghorbani指数是原子键连通性指数的一个新版本。D.帕切科等人。数学。第一版。Chem. 86(2021) 429-448]推测了所有双环图的graovaci - ghorbani指数的一个明显的下界和上界。在他们出色工作的激励下，本文确定了双环图的极大graovaci - ghorbani指数，并刻画了相应的极值图，从而解决了他们的一个猜想。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Match-Communications in Mathematical and in Computer Chemistry 化学-化学综合

CiteScore

4.40

自引率

26.90%

发文量

审稿时长

2 months

期刊介绍： MATCH Communications in Mathematical and in Computer Chemistry publishes papers of original research as well as reviews on chemically important mathematical results and non-routine applications of mathematical techniques to chemical problems. A paper acceptable for publication must contain non-trivial mathematics or communicate non-routine computer-based procedures AND have a clear connection to chemistry. Papers are published without any processing or publication charge.