Sharp lower bounds on the sum-connectivity index of trees
From MaRDI portal
Publication:5101878
DOI10.1142/S1793830921501536zbMath1493.05184OpenAlexW3179446242MaRDI QIDQ5101878
Publication date: 2 September 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501536
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Cites Work
- Extremal energies of trees with a given domination number
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
- On a novel connectivity index
- Bounds on the largest eigenvalues of trees with a given size of matching
- Extremal values on the eccentric distance sum of trees
- Some new bounds on the general sum--connectivity index
- Upper bounds for the forgotten topological index of graphs with given domination number