The geometric-arithmetic index and the chromatic number of connected graphs

DOI10.1016/j.dam.2017.08.003zbMath1372.05063OpenAlexW2754811662MaRDI QIDQ2410239

Pierre Hansen, Mustapha Aouchiche

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

zbMATH Keywords

chromatic numberclique numbergeometric-arithmetic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items

Unnamed Item, Bounds for the geometric-arithmetic index of unicyclic graphs, Unnamed Item, On the geometric-arithmetic index of a graph, The maximal geometric-arithmetic energy of trees with at most two branched vertices

Uses Software

• AutoGraphiX

Cites Work

• On the first geometric-arithmetic index of graphs
• 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. V: Three ways to automate finding conjectures
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item