REVIEW
Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
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
Sum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
classification
math.CO
keywords
graphsmaximumindicessum-connectivityunicyclicdegreetreesadditionally
read the original abstract
We obtain the maximum sum-connectivity indices of graphs in the set of trees and in the set of unicyclic graphs respectively with given number of vertices and maximum degree, and determine the corresponding extremal graphs. Additionally, we deduce the n-vertex unicyclic graphs with the first two maximum sum-connectivity indices for $n\ge 4$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.