Extremal graphs for the Randić index when minimum, maximum degrees and order of graphs are odd

DOI10.1080/02331934.2014.919500zbMath1337.05061OpenAlexW2070824098MaRDI QIDQ2808331

Ljiljana Pavlović, Bo Lian Liu, Tomica R. Divnić

Publication date: 23 May 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.919500

zbMATH Keywords

quadratic programmingsimple graphRandić indexKuhn-Tucker theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial optimization (90C27)

Related Items (2)

On the extremal graphs for general sum-connectivity index \((\chi_{{}_\alpha})\) with given cyclomatic number when \(\alpha > 1\) ⋮ Zeroth-order general Randić index of cactus graphs

Cites Work

• Unnamed Item
• On a conjecture about the Randić index
• On the conjecture of Delorme, Favaron and Rautenbach about the Randić index
• Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
• On the conjecture of Aouchiche and Hansen about the Randić index
• Proof of the first part of the conjecture of Aouchiche and Hansen about the Randić index
• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• A quadratic programming approach to the Randić index
• The linear programming approach to the Randić index
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• On the Randić index

This page was built for publication: Extremal graphs for the Randić index when minimum, maximum degrees and order of graphs are odd