The Atom-Bond Connectivity Index of Catacondensed Polyomino Graphs
Open Access
- 1 January 2013
- journal article
- Published by Hindawi Limited in Discrete Dynamics in Nature and Society
- Vol. 2013, 1-7
- https://doi.org/10.1155/2013/598517
Abstract
The Atom-Bond Connectivity Index of Catacondensed Polyomino Graphs: Let be a graph. The atom-bond connectivity (ABC) index is defined as the sum of weights over all edges of , where denotes the degree of a vertex of . 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 with squares and determine the corresponding extremal graphs.Keywords
Funding Information
- National Natural Science Foundation of China (11071272, 11101086, 11101087, 2012-XQ-30)
This publication has 10 references indexed in Scilit:
- Some upper bounds for the atom–bond connectivity index of graphsApplied Mathematics Letters, 2012
- The atom-bond connectivity index of chemical bicyclic graphsApplied Mathematics-A Journal of Chinese Universities, 2012
- Further results on atom-bond connectivity index of treesDiscrete Applied Mathematics, 2010
- Atom–bond connectivity index of treesDiscrete Applied Mathematics, 2009
- Maximum Zagreb index, minimum hyper-Wiener index and graph connectivityApplied Mathematics Letters, 2009
- A note on Kirchhoff indexChemical Physics Letters, 2008
- Perfect Matchings of Generalized Polyomino GraphsGraphs and Combinatorics, 2005
- Cell-shedding transformations, equivalence relations, and similarity measures for square-cell configurationsInternational Journal of Quantum Chemistry, 1997
- Chessboard domination problemsDiscrete Mathematics, 1990
- Combinatorial properties of polyominoesCombinatorica, 1981