A linear-programming approach to the generalized Randić index
✍ Scribed by Miranca Fischermann; Arne Hoffmann; Dieter Rautenbach; Lutz Volkmann
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 129 KB
- Volume
- 128
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
✦ Synopsis
The generalized Randià c index R (G) of a graph G is the sum of (dG(u)dG(v)) over all edges uv of G. Using a linear-programming approach, we establish results on graphs with a given number of vertices and edges and a bounded maximum degree that are of minimum generalized Randià c index for ∈ {-1 2 ; -1}.
📜 SIMILAR VOLUMES
In this paper we discuss how to deal with decision problems that are described with LP models and formulated with elements of imprecision and uncertainty. More precisely, we will study LP models in which the parameters are not fully known but only with some degree of precision. Even with incomplete