Some results on lower bounds for topological indices
From MaRDI portal
Publication:2000916
DOI10.1007/s10910-018-00999-7zbMath1416.92189OpenAlexW2909285183WikidataQ128595842 ScholiaQ128595842MaRDI QIDQ2000916
Álvaro Martínez-Pérez, José M. Rodríguez
Publication date: 1 July 2019
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-018-00999-7
Wiener indexgeneral sum-connectivity indexharmonic indexgeometric-arithmetic indexgeneralized Wiener index
Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items
Relations between the general sum connectivity index and the line graph ⋮ Unnamed Item ⋮ General Randić indices of a graph and its line graph ⋮ On the \(n\)-vertex trees with sixth to fifteenth maximum harmonic indices ⋮ Relations between some topological indices and the line graph
Uses Software
Cites Work
- On the first geometric-arithmetic index of graphs
- The harmonic index for graphs
- Minimum general sum-connectivity index of unicyclic graphs
- Spectral properties of geometric-arithmetic index
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- New lower bounds for the second variable Zagreb index
- Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Extremal graphs for weights
- Relationship between the Hosoya polynomial and the hyper-Wiener index
- Maximizing the sum of the squares of the degrees of a graph
- On general sum-connectivity index
- Generalized Wiener indices of zigzagging pentachains
- On the harmonic index and the chromatic number of a graph
- The Largest Vertex Degree Sum for a Triangle in a Graph
- An algorithm for the calculation of the hyper-Wiener index of benzenoid hydrocarbons
- New lower bounds for the Geometric-Arithmetic index
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item