A note on polyomino chains with extremum general sum-connectivity index
Abstract
The general sum-connectivity index of a graph G is defined as α(G)= Σuv∈ E(G) (du + dv)α where du is degree of the vertex u∈ V(G), α 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 α values from a certain collection of polyomino chain graphs is solved for α<0. The obtained results together with already known results (concerning extremum values of polyomino chain graphs) give the complete solution of the aforementioned problem.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.