Extremal polygonal cacti for bond incident degree indices

DOI10.1016/j.dam.2018.10.035zbMath1406.05051OpenAlexW2902197716MaRDI QIDQ1730249

Muhuo Liu, Yuedan Yao, Jiachang Ye, Kinkar Chandra Das

Publication date: 11 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.10.035

zbMATH Keywords

connectivity functioncactus graphsgeneral sum-connectivity indexsecond Zagreb indexbond incident degree indices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves ⋮ Some bond incident degree indices of (molecular) graphs with fixed order and number of cut vertices

Uses Software

• GRAFFITI

Cites Work

• Some extremal graphs with respect to inverse degree
• Functions on adjacent vertex degrees of trees with given degree sequence
• On a novel connectivity index
• On the extremal graphs with respect to bond incident degree indices
• Extremal graphs for vertex-degree-based invariants with given degree sequences
• On general sum-connectivity index
• \(M\)-polynomial revisited: Bethe cacti and an extension of Gutman's approach
• A majorization method for localizing graph topological indices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extremal polygonal cacti for bond incident degree indices