Cacti with the maximum Merrifield-Simmons index and given number of cut edges (Q602824): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3931424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5478959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of structure-sensitive graphical subsets: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of structure-sensitive graphical subsets: Calculations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3153163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite graphs can have any number of independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4852752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166462 / rank
 
Normal rank

Revision as of 09:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Cacti with the maximum Merrifield-Simmons index and given number of cut edges
scientific article

    Statements

    Cacti with the maximum Merrifield-Simmons index and given number of cut edges (English)
    0 references
    0 references
    5 November 2010
    0 references
    cactus
    0 references
    Merrifield-Simmons index
    0 references
    cut edge
    0 references
    extremal graph
    0 references

    Identifiers