On the geometric-arithmetic index of a graph
From MaRDI portal
Publication:1720337
DOI10.1016/j.dam.2018.06.021zbMath1404.05051OpenAlexW2884785461MaRDI QIDQ1720337
Publication date: 8 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.021
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Sharp bounds on the arithmetic-geometric index of graphs and line graphs ⋮ Unnamed Item ⋮ Bounds for the geometric-arithmetic index of unicyclic graphs ⋮ The geometric-arithmetic index of trees with a given total domination number ⋮ Inequalities on the geometric-arithmetic index ⋮ The maximal geometric-arithmetic energy of trees with at most two branched vertices ⋮ Relation between geometric-arithmetic and arithmetic-geometric indices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the first geometric-arithmetic index of graphs
- More bounds for the Grundy number of graphs
- Upper bounds for the achromatic and coloring numbers of a graph
- Spectral properties of geometric-arithmetic index
- Randić index and coloring number of a graph
- Extremal graphs for the geometric-arithmetic index with given minimum degree
- On geometric-arithmetic index
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
- On a relation between the atom-bond connectivity and the first geometric-arithmetic indices
- The geometric-arithmetic index and the chromatic number of connected graphs
- On the harmonic index and the chromatic number of a graph
This page was built for publication: On the geometric-arithmetic index of a graph