Some inequalities for the atom-Bond connectivity index of graph operations
From MaRDI portal
(Redirected from Publication:2275940)
Recommendations
Cites work
- \(\mathrm{GA}_2\) index of some graph operations
- A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
- Atom-bond connectivity index of graphs
- Atom-bond connectivity index of trees
- Further results on atom-bond connectivity index of trees
- Hosoya polynomial of composite graphs
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- On the PI index: PI-partitions and Cartesian product graphs
- On the sum of all distances in composite graphs
- Some new results on distance-based graph invariants
- The first and second Zagreb indices of some graph operations
- The hyper-Wiener index of graph operations
- The PI index of product graphs
- The Szeged and the Wiener index of graphs
- The Zagreb coindices of graph operations
- Vertex and edge PI indices of Cartesian product graphs
- Wiener-type invariants of some graph operations
Cited in
(33)- Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
- On ABC eigenvalues and ABC energy
- Some forbidden combinations of branches in minimal-ABC trees
- On extremality of ABC spectral radius of a tree
- On structural properties of trees with minimal atom-bond connectivity index. III: Trees with pendent paths of length three
- On the edge-version atom-bond connectivity and geometric arithmetic indices of certain graph operations
- On structural properties of trees with minimal atom-bond connectivity index. IV: solving a conjecture about the pendent paths of length three
- Extremal graphs with respect to generalized ABC index
- A solution of the conjecture about big vertices of minimal-ABC trees
- Atom-bond connectivity index of quasi-tree graphs
- On atom-bond connectivity index of graphs
- On a relation between the atom-bond connectivity and the first geometric-arithmetic indices
- Computer search for trees with minimal ABC index
- On structural properties of trees with minimal atom-bond connectivity index
- On the atom-bond connectivity index and radius of connected graphs
- Maximum values of atom-bond connectivity index in the class of tricyclic graphs
- On structural properties of trees with minimal atom-bond connectivity index. II: Bounds on B₁- and B₂-branches
- Bounds on the ABC spectral radius of a tree
- Sharp bounds on the augmented Zagreb index of graph operations
- Sharp bounds on the inverse sum indeg index
- scientific article; zbMATH DE number 7114842 (Why is no real title available?)
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- Complete characterization of the minimal-ABC trees
- The minimum ABC index of chemical trees
- Bounds of Sombor index for corona products on \(R\)-graphs
- The ABC Index Conundrum's Complete Solution
- Inequalities among topological descriptors
- The ABC matrix
- Bounds on Sombor index of graph operations
- On the topological indices on double graphs
- Sharp inequalities for the atom-bond sum-connectivity index of graph operations
- Maximum values of atom-bond connectivity index in the class of tetracyclic graphs
- Inequalities on the generalized atom bond connectivity index
This page was built for publication: Some inequalities for the atom-Bond connectivity index of graph operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275940)
