The geometric-arithmetic index and the chromatic number of connected graphs
DOI10.1016/J.DAM.2017.08.003zbMATH Open1372.05063OpenAlexW2754811662MaRDI QIDQ2410239FDOQ2410239
Authors: Mustapha Aouchiche, Pierre Hansen 
Publication date: 17 October 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.08.003
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topological index based on the ratios of geometrical and arithmetical means of end-vertex degrees of edges
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Recent results in the theory of Randić index.
- On the first geometric-arithmetic index of graphs
- Survey on geometric-arithmetic indices of graphs
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- On geometric-arithmetic index
- On the geometric-arithmetic index
- Extremal graphs for the geometric-arithmetic index with given minimum degree
Cited In (6)
- Bounds for the geometric-arithmetic index of unicyclic graphs
- On the geometric-arithmetic index of a graph
- Comparing the geometric-arithmetic index and the spectral radius of graphs
- The maximal geometric-arithmetic energy of trees with at most two branched vertices
- Bicyclic graphs with maximum geometric-arithmetic index
- Title not available (Why is that?)
Uses Software
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)
