Extremal trees with given degree sequence for the Randić index (Q932617): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.06.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2143132812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Randić index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830181 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5450337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees of extremal connectivity index / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on trees of maximum weight and restricted degrees / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:22, 28 June 2024

scientific article
Language Label Description Also known as
English
Extremal trees with given degree sequence for the Randić index
scientific article

    Statements

    Extremal trees with given degree sequence for the Randić index (English)
    0 references
    0 references
    11 July 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    tree
    0 references
    Randić index
    0 references
    connectivity index
    0 references
    weight
    0 references
    degree sequence
    0 references
    0 references