A linear-programming approach to the generalized Randić index
From MaRDI portal
Publication:1811120
DOI10.1016/S0166-218X(02)00500-0zbMATH Open1020.05036MaRDI QIDQ1811120FDOQ1811120
Authors: Miranca Fischermann, Arne Hoffmann, Dieter Rautenbach, Lutz Volkmann 
Publication date: 10 June 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Linear programming (90C05) Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35)
Cites Work
Cited In (15)
- A note on trees of maximum weight and restricted degrees
- On a conjecture of the Randić index and the minimum degree of graphs
- Which generalized Randić indices are suitable measures of molecular branching?
- Title not available (Why is that?)
- Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees
- A mathematical programming model for computing the fries number of a fullerene
- On the conjecture of Delorme, Favaron and Rautenbach about the Randić index
- The general Randić index of trees with given number of pendent vertices
- Complete solution to a conjecture on Randić index
- The linear programming approach to the Randić index
- A unified linear-programming modeling of some topological indices
- Conjugated trees with minimum general Randić index
- A sharp lower bound of the Randić index of cacti with \(r\) pendants
- Linear integral indices for approximating the association matrix. I
- Minimizer graphs for a class of extremal problems
This page was built for publication: A linear-programming approach to the generalized Randić index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811120)
