1 research outputs found

    A note on polyomino chains with extremum general sum-connectivity index

    Full text link
    The general sum-connectivity index of a graph GG is defined as χα(G)=βˆ‘uv∈E(G)(du+dv)Ξ±\chi_{\alpha}(G)= \sum_{uv\in E(G)} (d_u + d_{v})^{\alpha} where dud_{u} is degree of the vertex u∈V(G)u\in V(G), Ξ±\alpha is a real number different from 00 and uvuv is the edge connecting the vertices u,vu,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 Ξ±<0\alpha<0. The obtained results together with already known results (concerning extremum values of polyomino chain graphs) give the complete solution of the aforementioned problem
    corecore