Extremal results and bounds for atom-bond sum-connectivity index
From MaRDI portal
Publication:6562216
Recommendations
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- On the Maximum Atom-Bond Sum-Connectivity Index of Trees
- Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number
- The greatest values for atom-bond sum-connectivity index of graphs with given parameters
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 4173028 (Why is no real title available?)
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 6506585 (Why is no real title available?)
- scientific article; zbMATH DE number 7389738 (Why is no real title available?)
- scientific article; zbMATH DE number 7410264 (Why is no real title available?)
- scientific article; zbMATH DE number 6282161 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- scientific article; zbMATH DE number 7644300 (Why is no real title available?)
- scientific article; zbMATH DE number 7792723 (Why is no real title available?)
- A general modeling of some vertex-degree based topological indices in benzenoid systems and phenylenes
- Atom-bond sum-connectivity index
- Atom-bond sum-connectivity index of line graphs
- Atom–bond connectivity index of graphs: a review over extremal results and bounds
- Beyond the Zagreb indices
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- Bond incident degree (BID) indices of polyomino chains: a unified approach
- Bond incident degree indices of connected \((n, m)\)-graphs with fixed maximum degree
- Bounds for Zagreb indices
- Complete characterization of the minimal-ABC trees
- Extensions of Gallai's graph covering theorems for uniform hypergraphs
- Extremal graphs for topological index defined by a degree-based edge-weight function
- Extremal graphs for vertex-degree-based invariants with given degree sequences
- Extremal polygonal cacti for bond incident degree indices
- Extremal problems for degree-based topological indices
- Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number
- Extremal properties of the bipartite vertex frustration of graphs
- Extremal trees with respect to functions on adjacent vertex degrees
- Extremal triangular chain graphs for bond incident degree (BID) indices.
- Extremal values of the atom-bond sum-connectivity index in bicyclic graphs
- Extremal values of vertex-degree-based topological indices over hexagonal systems with fixed number of vertices
- Extremality of VDB topological indices over f-benzenoids with given order
- From the connectivity index to various Randić-type descriptors
- Functions on adjacent vertex degrees of trees with given degree sequence
- General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index
- Graph theory
- Graphs having extremal monotonic topological indices with bounded vertex \(k\)-partiteness
- Harmonic index and its generalizations: extremal results and bounds
- Maximum Atom-Bond Sum-Connectivity Index of n-Order Trees With Fixed Number of Leaves
- Maximum atom bond sum connectivity index of molecular trees with a perfect matching
- Minimum atom-bond sum-connectivity index of unicyclic graphs with maximum degree
- Note on the Minimum Bond Incident Degree Indices of k-Cyclic Graphs
- On (exponential) bond incident degree indices of graphs
- On Topological Indices and Their Reciprocals
- On a novel connectivity index
- On bond incident degree index of chemical trees with a fixed order and a fixed number of leaves
- On extremal bipartite graphs with a given connectivity
- On extremal bipartite graphs with given number of cut edges
- On general sum-connectivity index
- On history of the Randić index and emerging hostility toward chemical graph theory
- On the Difference of Atom-Bond Sum-Connectivity and Atom-Bond-Connectivity Indices
- On the Maximum Atom-Bond Sum-Connectivity Index of Trees
- On the extremal graphs with respect to bond incident degree indices
- On the maximum atom-bond sum-connectivity index of graphs
- On the monotonicity of topological indices and the connectivity of a graph
- Sharp inequalities for the atom-bond (sum) connectivity index
- Smallest ABS index of unicyclic graphs with given girth
- Some new bounds on the general sum-connectivity index
- Stepwise irregular graphs
- Sum of powers of the degrees of graphs: extremal results and bounds
- The ABC Index Conundrum's Complete Solution
- The ABC index conundrum
- The complexity of spanning tree problems involving graphical indices
- The evolution of the structure of ABC-minimal trees
- The extremal values of some topological indices in bipartite graphs with a given matching number
- The greatest values for atom-bond sum-connectivity index of graphs with given parameters
- The minimum ABC index of chemical trees
- The vertex-degree-based topological indices of fluoranthene-type Benzenoid systems
- Unified extremal results for (exponential) bond incident degree indices of trees
- Unified extremal results for \(k\)-apex unicyclic graphs (trees)
This page was built for publication: Extremal results and bounds for atom-bond sum-connectivity index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562216)