Abstract
For a (molecular) graph G, the general sum-connectivity index Xα(G) is defined as the sum of the weights [du + dv]αof all edges uv of G, where du (or dv) denotes the degree of a vertex u (or v) in G and α is an arbitrary real number. In this paper, we give an efficient formula for computing the general sum-connectivity index of polyomino chains and characterize the extremal polyomino chains with respect to this index, which generalizes one of the main results in [Z. Yarahmadi, A. Ashrafi, S. Moradi, Extremal polyomino chains with respect to Zagreb indices, Appl. Math. Lett. 25 (2012): 166-171],.
Original language | English |
---|---|
Pages (from-to) | 255-271 |
Number of pages | 17 |
Journal | Ars Combinatoria |
Volume | 131 |
Publication status | Published - Jan 2017 |
Keywords
- General sum-connectivity index
- Polyomino chain