Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number
DOI10.1016/j.dam.2023.11.046zbMath1530.05032OpenAlexW4389469353MaRDI QIDQ6145822
Kinkar Chandra Das, Hai Ying Wang, Guifu Su, Yuan Zhang
Publication date: 9 January 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.11.046
Trees (05C05) Extremal problems in graph theory (05C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)
Cites Work
- Unnamed Item
- Extremal energies of trees with a given domination number
- Comparison between the zeroth-order Randić index and the sum-connectivity index
- On extremal Zagreb indices of trees with given domination number
- Atom-bond connectivity index of graphs
- Permanent of the Laplacian matrix of trees and bipartite graphs
- On a novel connectivity index
- Average distance and domination number
- Solution to a conjecture on the maximum ABC index of graphs with given chromatic number
- Atom-bond sum-connectivity index
- Maximizing the Index of Trees with Given Domination Number
- Inverse degree, Randic index and harmonic index of graphs
- The harmonic index for trees with given domination number
This page was built for publication: Extremal problems on the atom-bond sum-connectivity indices of trees with given matching number or domination number
