A linear-programming approach to the generalized Randić index (Q1811120): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2713652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs for weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Randić index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232250 / rank
 
Normal rank

Latest revision as of 17:29, 5 June 2024

scientific article
Language Label Description Also known as
English
A linear-programming approach to the generalized Randić index
scientific article

    Statements

    A linear-programming approach to the generalized Randić index (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2003
    0 references
    The sum of \((d(u)d(v))^\alpha\) over all edges \(uv\) of a graph \(G\) is called the generalized Randić index \(R_\alpha(G)\) of \(G\). The authors obtain results on graphs \(G\) with a minimum value of \(R_\alpha(G)\) among graphs with \(n\) vertices, \(m\) edges, and maximum degree at most \(\Delta\) when \(\alpha= -1/2\) or \(-1\).
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded degrees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references