The geometric-arithmetic index and the chromatic number of connected graphs
From MaRDI portal
Publication:2410239
Recommendations
Cites work
- Extremal graphs for the geometric-arithmetic index with given minimum degree
- scientific article; zbMATH DE number 5251354 (Why is no real title available?)
- scientific article; zbMATH DE number 5259316 (Why is no real title available?)
- On geometric-arithmetic index
- On the first geometric-arithmetic index of graphs
- On the geometric-arithmetic index
- Recent results in the theory of Randić index.
- Survey on geometric-arithmetic indices of graphs
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
Cited in
(7)- On the geometric-arithmetic index of a graph
- The maximal geometric-arithmetic energy of trees with at most two branched vertices
- Bicyclic graphs with maximum geometric-arithmetic index
- Comparing the geometric-arithmetic index and the spectral radius of graphs
- scientific article; zbMATH DE number 7090174 (Why is no real title available?)
- Bounds for the geometric-arithmetic index of unicyclic graphs
- Harmonic-arithmetic index of unicyclic graphs
This page was built for publication: The geometric-arithmetic index and the chromatic number of connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2410239)