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

DOI10.1080/02331934.2014.919500zbMATH Open1337.05061OpenAlexW2070824098MaRDI QIDQ2808331FDOQ2808331

Ljiljana Pavlović, Bolian 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 graphKuhn-Tucker theoremRandić index

Mathematics Subject Classification ID

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

Cites Work

• Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
• Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number
• Recent results in the theory of Randić index.
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• On the Randić index
• On a conjecture about the Randić index
• A quadratic programming approach to the Randić index
• The linear programming approach to the Randić index
• 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
• On the conjecture of Delorme, Favaron and Rautenbach about the Randić index

Cited In (6)

• On the extremal graphs for general sum-connectivity index \((\chi_{{}_\alpha})\) with given cyclomatic number when \(\alpha > 1\)
• Graphs that minimizing max-min rodeg index
• Extremal graphs for the geometric-arithmetic index with given minimum degree
• Extremal graphs with given order and the rupture degree
• Title not available (Why is that?)
• Zeroth-order general Randić index of cactus graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808331)