1. A note on the minimum inverse sum indeg index of cacti
- Author
-
Mei Lu and Yisheng Jiang
- Subjects
Index (economics) ,Simple graph ,Degree (graph theory) ,Applied Mathematics ,Inverse ,Combinatorics ,chemistry.chemical_compound ,chemistry ,Cactus ,Discrete Mathematics and Combinatorics ,Order (group theory) ,Connectivity ,Mathematics ,Octane - Abstract
Let G = ( V , E ) be a simple graph. The inverse sum indeg index of G is defined as I S I ( G ) = ∑ u v ∈ E ( G ) d ( u ) d ( v ) d ( u ) + d ( v ) , where d ( u ) is the degree of u . This index has a nice predicting ability for the total surface area of octane isomers. A cactus is a connected graph in which all of its blocks are either edges or cycles. Let C n , k be the set of cacti of order n and with k cycles. In this note, we characterize all cacti with minimum inverse sum indeg index among C n , k when n ≥ 6 k − 3 .
- Published
- 2021
- Full Text
- View/download PDF