Abstract
The general sum-connectivity index of a graph G is defined as chi(alpha)(G) = Sigma(uv is an element of E(G))(d(u) + d(v))(alpha) where d(u) is degree of the vertex u is an element of V (G), alpha is a real number different from 0 and uv is the edge connecting the vertices u, v. In this note, the problem of characterizing the graphs having extremum chi(alpha) values from a certain collection of polyomino chain graphs is solved for alpha < 0. The obtained results together with already known results (concerning extremum chi(alpha) values of polyomino chain graphs) give the complete solution of the aforementioned problem.