On the maximal general ABC index of graphs with given maximum degree
From MaRDI portal
Publication:2656737
Recommendations
Cites work
- A formula with its applications on the difference of Zagreb indices of graphs
- Atom-bond connectivity index of graphs
- Atom-bond connectivity index of trees
- Augmented Zagreb index
- Bounds for the augmented Zagreb and the atom-bond connectivity indices
- Efficient computation of trees with minimal atom-bond connectivity index
- Extremal graphs with respect to generalized ABC index
- Maximum atom-bond connectivity index with given graph parameters
- Notes on trees with minimal atom-bond connectivity index
- On ABC index of graphs
- On atom-bond connectivity index
- On atom-bond connectivity index of graphs
- On structural properties of ABC-minimal chemical trees
- On structure-sensitivity of degree-based topological indices
- On the maximum ABC index of graphs without pendent vertices
- Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
Cited in
(11)- On the maximum ABC index of graphs without pendent vertices
- Extremal graphs with respect to generalized ABC index
- On ABC Estrada index of graphs
- On subtree number index of generalized book graphs, fan graphs, and wheel graphs
- On general \(A B C\)-type index of connected graphs
- Inverse degree index: exponential extension and applications
- Certain topological indices and polynomials for the Isaac graphs
- On the generalized ABC index of graphs
- Bounds on the general atom-bond connectivity indices
- scientific article; zbMATH DE number 7427108 (Why is no real title available?)
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
This page was built for publication: On the maximal general ABC index of graphs with given maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656737)