The number of independent sets of tricyclic graphs (Q452922): 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: Q5452529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Merrifield-Simmons index in \((n,n+ 1)\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tricyclic graphs with maximum Merrifield-Simmons index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5450429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452549 / rank
 
Normal rank

Revision as of 16:22, 5 July 2024

scientific article
Language Label Description Also known as
English
The number of independent sets of tricyclic graphs
scientific article

    Statements

    The number of independent sets of tricyclic graphs (English)
    0 references
    0 references
    0 references
    18 September 2012
    0 references
    independent set
    0 references
    Fibonacci number
    0 references
    tricyclic graph
    0 references

    Identifiers