On Sum--Connectivity Index of Bicyclic Graphs
Zhibin Du, Bo Zhou

TL;DR
This paper investigates the extremal sum--connectivity indices of bicyclic graphs with given vertices and matching number, identifying the graphs that maximize or minimize this index.
Contribution
It determines the minimum, maximum, and second extremal sum--connectivity indices of bicyclic graphs for specified parameters and characterizes the extremal graphs.
Findings
Identified graphs with minimum sum--connectivity index.
Identified graphs with maximum sum--connectivity index.
Characterized extremal graphs for given parameters.
Abstract
We determine the minimum sum--connectivity index of bicyclic graphs with vertices and matching number , where , the minimum and the second minimum, as well as the maximum and the second maximum sum--connectivity indices of bicyclic graphs with vertices. The extremal graphs are characterized.
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 · Graph Labeling and Dimension Problems · Alzheimer's disease research and treatments
