A linear-programming approach to the generalized Randić index

The generalized Randić index R α ( G) of a graph G is the sum of ( d G ( u) d G ( 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ć index for...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 128; no. 2; pp. 375 - 385
Main Authors Fischermann, Miranca, Hoffmann, Arne, Rautenbach, Dieter, Volkmann, Lutz
Format Journal Article
LanguageEnglish
Published Lausanne Elsevier B.V 01.06.2003
Amsterdam Elsevier
New York, NY
Subjects
Applied sciences
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Linear programming
Mathematical programming
Mathematics
Operational research and scientific management
Operational research. Management science
Randić index
Sciences and techniques of general use
Randić index
Linear programming
Minimum
Randic index
Index
Graph theory
Simple graph
Result
Maximum
Graph
Number
Edge
Non directed graph
Index theory
Online AccessGet full text

Cover

More Information
Summary:The generalized Randić index R α ( G) of a graph G is the sum of ( d G ( u) d G ( 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ć index for α∈{− 1 2 ,−1} .
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(02)00500-0