## Theory and Applications of Periodic Solutions and Almost Periodic Solutions

View this Special IssueResearch Article | Open Access

# The Atom-Bond Connectivity Index of Catacondensed Polyomino Graphs

**Academic Editor:**Zhengkun Huan

#### Abstract

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.

#### 1. Introduction

One of the most active fields of research in contemporary chemical graph theory is the study of topological indices (graph topological invariants) that can be used for describing and predicting physicochemical and pharmacological properties of organic compounds. In chemistry and for chemical graphs, these invariant numbers are known as the topological indices. There are many publications on the topological indices, see [1–6].

Let be a simple graph of order . A few years ago, Estrada et al. [7] introduced a further vertex-degree-based graph invariant, known as the atom-bond connectivity () index. It is defined as:

The index keeps the spirit of the Randić index, and it provides a good model for the stability of linear and branched alkanes as well as the strain energy of cycloalkanes [7]. Recently, the study of the index attracts some research attention [6, 8–12].

Polyomino graphs [13], also called chessboards [14] or square-cell configurations [15] have attracted some mathematicians’ considerable attention because many interesting combinatorial subjects are yielded from them such as domination problem and modeling problems of surface chemistry. A polyomino graph [16] is a connected geometric graph obtained by arranging congruent regular squares of side length 1 (called a cell) in a plane such that two squares are either disjoint or have a common edge. The polyomino graph has received considerable attentions.

Next, we introduce some graph definitions used in this paper.

*Definition 1 (see [4]). * Let be a polyomino graph. If all vertices of lie on its perimeter, then is said to be catacondensed polyomino graph or tree-like polyomino graph. (see Figure 1).

*Definition 2 (see [16]). * Let be a chain polyomino graph with squares. If the subgraph obtained from by deleting all the vertices of degree 2 and all the edges adjacent to the vertices is a path, then is said to be the zigzag chain polyomino graph, denoted by (see Figure 1).

In this paper, we give the indices of the zigzag chain polyomino graphs with squares and obtain the sharp upper bound on the indices of catacondensed polyomino graphs with squares and determine the corresponding extremal graphs.

#### 2. The Indices of Catacondensed Polyomino Graphs

Let We call the weight of the edge , denoted by .

Note that for any catacondensed polyomino graph with squares, it can be obtained by gluing a new square to some catacondensed polyomino graph with squares. So, we have the following lemma.

Lemma 3. *Let be a catacondensed polyomino graph with squares which is obtained by gluing a new square to some graph , where is a catacondensed polyomino graph with squares. One has *(i)*, ,*(ii)*, .*

* Proof. Consider the following: *(i) if , by directly calculating, we have ,

(ii) now, let . Without the loss of generality, let square be adjacent to the edge in (see Figure 2). In the following, if the weights of some edges of have been changed when is adjacent to the edge in , then we marked these edges with thick lines in . Let . Note that except the edge of , the summation of the weights of the remaining three edges is always in . There are exactly three types of formations (see Figure 2).*Case **1. * In Type I, and (see Figure 3).

By the definition of index, we have = + + + = (). If , then . If or , then . If , then .*Case **2.* In Type II, , ,, and. (see Figure 4).

Let adjacent to and , adjacent to (see Figure 4). Then , , and . If , , and , which is in contradiction with ; if , which is in contradiction with ; if , which is in contradiction with ().

By the definition of index, we have = + + + + = (). If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then .*Case **3.* In Type III, and (see Figure 5).

Let , adjacent to and , adjacent to (see Figure 5). Then, , , , and . Since the case is the same as , where . And note that if or , the vertices and are symmetric.

By the definition of index, we have (). If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then . If , then .

By directly calculating, we have , , , , , , , and , . So , where .

Therefore, .

By Lemma 3, we have the following theorem.

Theorem 4. * Let be a catacondensed polyomino graph with squares, then
**
where is a nonnegative integer for and .*

* Proof. *We prove Theorem 4 by the induction on . If , by directly calculating, we have , where (). So, Theorem 4 holds for .

Assume that Theorem 4 holds for all catacondensed polyomino graphs with () squares, that is,
where is a nonnegative integer for and .

We will prove that Theorem 4 holds for in the following. Let be a catacondensed polyomino graph with squares. Without the loss of generality, can be obtained from some catacondensed polyomino graph with squares by gluing a new square to . By Lemma 3, we have . It means that , where . By the induction assumption and direct computation, we have
There exists some such that and for (). Obviously, is a nonnegative integer for and .

Lemma 5. *Let be a catacondensed polyomino graph with squares. If , there are exactly four nonisomorphism catacondensed polyomino graphs (see Figure 6), where , , , .*

Theorem 6. *Let be a zigzag chain polyomino graph with squares, then
*

*Proof. *Obviously, can be obtained by gluing a new square to . Let be the square adjacent to (see Figure 1). We will prove Theorem 6 by the induction on .

If , then Theorem 6 holds (by Lemma 5). Assume that for . By the induction assumption and the in Lemma 3, we have

So, Theorem 6 holds.

Note that for and by Lemma 5, we obtain the following Theorem 7.

Theorem 7. *Let be a catacondensed polyomino graph with squares, then , with the equality if and only if .*

#### Acknowledgments

The project was supported by NSFC (no. 11071272; 11101086; 11101087) and the Foundation of Fuzhou University (no. 2012-XQ-30).

#### References

- A. Behtoei, M. Jannesari, and B. Taeri, “Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity,”
*Applied Mathematics Letters*, vol. 22, no. 10, pp. 1571–1576, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - K. C. Das, I. Gutman, and B. Furtula, “Survey on geometric-arithmetic indices of graphs,”
*MATCH Communications in Mathematical and in Computer Chemistry*, vol. 65, no. 3, pp. 595–644, 2011. View at: Google Scholar | MathSciNet - B. Liu and I. Gutman, “On general Randić indices,”
*MATCH Communications in Mathematical and in Computer Chemistry*, vol. 58, no. 1, pp. 147–154, 2007. View at: Google Scholar | Zentralblatt MATH | MathSciNet - B. Liu and Z. You, “A survey on comparing Zagreb indices,”
*MATCH Communications in Mathematical and in Computer Chemistry*, vol. 65, no. 3, pp. 581–593, 2011. View at: Google Scholar | MathSciNet - J. Liu and B. Liu, “E-L equienergetic graphs,”
*Communications in Mathematical and in Computer Chemistry*, vol. 66, no. 3, pp. 971–976, 2011. View at: Google Scholar | MathSciNet - B. Zhou and N. Trinajstic, “Further results on atom-bond connectivity index of trees,”
*Chemical Physics Letters*, vol. 455, pp. 120–123, 2008. View at: Google Scholar - E. Estrada, L. Torres, L. Rodriguez, and I. Gutman, “An atom-bond connectivity index: modelling the enthalpy of formation of alkanes,”
*Indian Journal of Chemistry A*, vol. 37, pp. 849–855, 1998. View at: Google Scholar - J. Chen and X. Guo, “Extreme atom-bond connectivity index of graphs,”
*MATCH Communications in Mathematical and in Computer Chemistry*, vol. 65, no. 3, pp. 713–722, 2011. View at: Google Scholar | MathSciNet - J. Chen and X. Guo, “The atom-bond connectivity index of chemical bicyclic graphs,”
*Applied Mathematics B*, vol. 27, no. 2, pp. 243–252, 2012. View at: Google Scholar | MathSciNet - J. Chen, J. Liu, and X. Guo, “Some upper bounds for the atom-bond connectivity index of graphs,”
*Applied Mathematics Letters*, vol. 25, no. 7, pp. 1077–1081, 2012. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - B. Furtula, A. Graovac, and D. Vukičević, “Atom-bond connectivity index of trees,”
*Discrete Applied Mathematics*, vol. 157, no. 13, pp. 2828–2835, 2009. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - R. Xing, B. Zhou, and Z. Du, “Further results on atom-bond connectivity index of trees,”
*Discrete Applied Mathematics*, vol. 158, no. 14, pp. 1536–1545, 2010. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - C. Berge, C. C. Chen, V. Chvátal, and C. S. Seow, “Combinatorial properties of polyominoes,”
*Combinatorica*, vol. 1, no. 3, pp. 217–224, 1981. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - E. J. Cockayne, “Chessboard domination problems,”
*Discrete Mathematics*, vol. 86, no. 1–3, pp. 13–20, 1990. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - F. Harary and P. Mezey, “Cell-shedding transformations, equivalence relations, and similarity measures for square-cell configurations,”
*International Journal of Quantum Chemistry*, vol. 62, pp. 353–361, 1997. View at: Google Scholar - R. Chen, “Perfect matchings of generalized polyomino graphs,”
*Graphs and Combinatorics*, vol. 21, no. 4, pp. 515–529, 2005. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet

#### Copyright

Copyright © 2013 Jinsong Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.