A linear-programming approach to the generalized Randić index
From MaRDI portal
Publication:1811120
DOI10.1016/S0166-218X(02)00500-0zbMath1020.05036MaRDI QIDQ1811120
Miranca Fischermann, Arne Hoffmann, Lutz Volkmann, Dieter Rautenbach
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Linear programming (90C05)
Related Items (11)
Complete solution to a conjecture on Randić index ⋮ On the conjecture of Delorme, Favaron and Rautenbach about the Randić index ⋮ Which generalized Randić indices are suitable measures of molecular branching? ⋮ Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees ⋮ A note on trees of maximum weight and restricted degrees ⋮ On a conjecture of the Randić index and the minimum degree of graphs ⋮ The general Randić index of trees with given number of pendent vertices ⋮ A unified linear-programming modeling of some topological indices ⋮ A sharp lower bound of the Randić index of cacti with \(r\) pendants ⋮ A mathematical programming model for computing the fries number of a fullerene ⋮ Conjugated trees with minimum general Randić index
Cites Work
This page was built for publication: A linear-programming approach to the generalized Randić index