On the conjecture of Aouchiche and Hansen about the Randić index

DOI10.1016/j.disc.2012.10.012zbMath1256.05120OpenAlexW2007604426WikidataQ122917181 ScholiaQ122917181MaRDI QIDQ1928442

Ljiljana Pavlović, Tomica R. Divnić, Marina M. Stojanović, Jianxi Liu, Bo Lian Liu

Publication date: 3 January 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.10.012

zbMATH Keywords

quadratic programmingRandić indexmaximum vertex degreeminimum vertex degreeKuhn-Tucker theoremAouchiche-Hansen conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Quadratic programming (90C20) Vertex degrees (05C07)

Related Items (6)

Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index ⋮ More bounds for the Grundy number of graphs ⋮ The variation of the Randić index with regard to minimum and maximum degree ⋮ Upper bounds for the achromatic and coloring numbers of a graph ⋮ Extremal graphs for the Randić index when minimum, maximum degrees and order of graphs are odd ⋮ Randić index and coloring number of a graph

This page was built for publication: On the conjecture of Aouchiche and Hansen about the Randić index