The Atom-Bond Connectivity Index of Catacondensed Polyomino Graphs-Reference-Cited by-同舟云学术

The Atom-Bond Connectivity Index of Catacondensed Polyomino Graphs

Published:2013 Issue: Volume:2013 Page:1-7
ISSN:1026-0226
Container-title:Discrete Dynamics in Nature and Society
language:en
Short-container-title:Discrete Dynamics in Nature and Society

Author:

Chen Jinsong¹²,Liu Jianping¹,Li Qiaoliang²

Affiliation:

1. College of Mathematics and Computer Science, Fuzhou University, Fuzhou, Fujian 350108, China

2. College of Mathematics and Computer Science, Hunan Normal University, Changsha, Hunan 410081, China

Abstract

LetG=(V,E)be a graph. The atom-bond connectivity (ABC) index is defined as the sum of weights((du+dv−2)/dudv)1/2over all edgesuvofG, wheredudenotes the degree of a vertexuofG. In this paper, we give the atom-bond connectivity index of the zigzag chain polyomino graphs. Meanwhile, we obtain the sharp upper bound on the atom-bond connectivity index of catacondensed polyomino graphs withhsquares and determine the corresponding extremal graphs.

Funder

National Natural Science Foundation of China

Publisher

Hindawi Limited

Subject

Modelling and Simulation

Link

http://downloads.hindawi.com/journals/ddns/2013/598517.pdf

Reference16 articles.

1. Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The evolution of the structure of ABC-minimal trees;Journal of Combinatorial Theory, Series B;2022-01

2. Atom–bond connectivity index of graphs: a review over extremal results and bounds;Discrete Mathematics Letters;2021-03-29

3. Some forbidden combinations of branches in minimal-ABC trees;Discrete Applied Mathematics;2018-02

4. On the Maximum ABC Index of Graphs With Prescribed Size and Without Pendent Vertices;IEEE Access;2018

5. On structural properties of trees with minimal atom-bond connectivity index II: Bounds on B1- and B2-branches;Discrete Applied Mathematics;2016-05