A note on polyomino chains with extremum general sum-connectivity index
Akbar Ali, Tahir Idrees

TL;DR
This paper characterizes polyomino chain graphs with extremum general sum-connectivity index for negative alpha, completing the understanding of their extremal properties in this class.
Contribution
It provides a complete characterization of extremal polyomino chain graphs with respect to the general sum-connectivity index for alpha<0.
Findings
Identifies graphs with maximum and minimum sum-connectivity index for alpha<0.
Completes the classification of extremal polyomino chains for all alpha values.
Extends previous results to the case of negative alpha.
Abstract
The general sum-connectivity index of a graph is defined as where is degree of the vertex , is a real number different from and is the edge connecting the vertices . In this note, the problem of characterizing the graphs having extremum values from a certain collection of polyomino chain graphs is solved for . The obtained results together with already known results (concerning extremum values of polyomino chain graphs) give the complete solution of the aforementioned problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Graphene research and applications · Synthesis and Properties of Aromatic Compounds
