Several Asymptotic Bounds on the Balaban Indices of Trees-Reference-Cited by-同舟云学术

Several Asymptotic Bounds on the Balaban Indices of Trees

Published:2020-11-06 Issue: Volume:2020 Page:1-6
ISSN:1563-5147
Container-title:Mathematical Problems in Engineering
language:en
Short-container-title:Mathematical Problems in Engineering

Author:

Deng Bo¹²³⁴^ORCID,Ye Chengfu¹,Liang Weilin¹,Li Yalan⁵,Su Xueli¹

Affiliation:

1. School of Mathematics and Statistics, Qinghai Normal University, Xining 810001, China

2. Academy of Plateau, Science and Sustainability, Xining, Qinghai 810008, China

3. Key Laboratory of Tibetan Information Processing, Ministry of Education, Xining, Qinghai Province, China

4. Tibetan Intelligent Information Processing and Machine Translation Key Laboratory, Qinghai 810008, China

5. School of Computer, Qinghai Normal University, Xining 810001, China

Abstract

The Balaban index (also called the

J

index) of a connected graph

G

is a distance-based topological index, which has been successfully used in various QSAR and QSPR modeling. Although the index was introduced 30 years ago, there are few results on the asymptotic relations. In this paper, several asymptotic bounds on the Balaban indices of trees with diameters 3 and 4 are shown, respectively.

Funder

NSFQH

Publisher

Hindawi Limited

Subject

General Engineering,General Mathematics

Link

http://downloads.hindawi.com/journals/mpe/2020/2081241.pdf

Reference14 articles.

1. Highly discriminating distance-based topological index

2. Handbook of Molecular Descriptors

3. Study on supramolecular complexing ability vis-à-vis estimation of pKa of substituted sulfonamides: Dominating role of Balaban index (J)

4. Computer-assisted rational design of immunosuppressive compounds