Extremal triangular chain graphs for bond incident degree (BID) indices.
From MaRDI portal
Publication:4558658
Abstract: A general expression for calculating the bond incident degree (BID) indices of certain triangular chain graphs is derived. The extremal triangular chain graphs with respect to several well known BID indices are also characterized over a particular collection of triangular chain graphs.
Recommendations
- On the extremal graphs with respect to bond incident degree indices
- On bond incident degree indices of \((n,m)\)-graphs
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- On (exponential) bond incident degree indices of graphs
- Bond incident degree indices of catacondensed pentagonal systems
Cited in
(12)- Bond incident degree indices of catacondensed pentagonal systems
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- Extremal results and bounds for atom-bond sum-connectivity index
- Unified extremal results for (exponential) bond incident degree indices of trees
- On bond incident degree indices of \((n,m)\)-graphs
- Symmetric Division Deg Index: Extremal Results and Bounds
- On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves
- On the extremal graphs with respect to bond incident degree indices
- Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains
- On (exponential) bond incident degree indices of graphs
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- Bond incident degree (BID) indices of line graphs of some chemical structures in drugs.
This page was built for publication: Extremal triangular chain graphs for bond incident degree (BID) indices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558658)
