REVIEW
On Sum--Connectivity Index of Bicyclic Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
On Sum--Connectivity Index of Bicyclic Graphs
classification
math.CO
keywords
graphsbicyclicminimumsum--connectivityindexmaximumsecondvertices
read the original abstract
We determine the minimum sum--connectivity index of bicyclic graphs with $n$ vertices and matching number $m$, where $2\le m\le \lfloor\frac{n}{2}\rfloor$, the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with $n\ge 5$ vertices. The extremal graphs are characterized.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.