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.
Recommendations
- Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
- General sum-connectivity index with 1 for bicyclic graphs
- Byciclic graphs with minimum general sum-connectivity index for \(-1\leq \alpha <0\)
- On the sum-connectivity index
- Trees and unicyclic graphs extremal with respect to sum connectivity index
Cited in
(16)- On the harmonic index and the chromatic number of a graph
- Sum-connectivity index of a graph
- Extremal results for cacti
- Extremal problems for degree-based topological indices
- Randić connectivity and sum-connectivity indices for Capra-designed of cycles
- The harmonic index for graphs
- Reduced Sombor index of bicyclic graphs
- The minimum general sum-connectivity index of trees with given matching number
- On the sum-connectivity index of cacti
- Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
- On a novel connectivity index
- scientific article; zbMATH DE number 2170440 (Why is no real title available?)
- The degree-based topological indices for two special families of graphs of diameter three
- scientific article; zbMATH DE number 6807830 (Why is no real title available?)
- On the graphs of a fixed cyclomatic number and order with minimum general sum-connectivity and platt indices
- Sharp lower bounds on the sum-connectivity index of quasi-tree graphs
This page was built for publication: On sum-connectivity index of bicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656104)