Fibonacci Numbers of Graphs

1982/02/01 by Helmut Prodinger, Robert F. Tichy · 14 citations
Physics and Astronomy · Computer Science · Mathematics · #Advanced Mathematical Theories and Applications #Graph Labeling and Dimension Problems #Graph theory and applications

paper · doi:10.1080/00150517.1982.12430021

Cited by

• The number of F-matchings in almost every tree is a zero residue
• On the Fibonacci-Lucas Ground State Degeneracies of the One-Dimensional Antiferromagnetic Ising Model at Criticality
• Fibonacci numbers and Lucas numbers in graphs
• On the independence polynomial of an antiregular graph
• Long paths need not minimize H-colorings among trees
• Independent Sets in n-vertex k-chromatic, ℓ-connected graphs
• The independence polynomial of a graph at -1
• On the domination polynomials of cactus chains
• On 2-level polytopes arising in combinatorial settings
• Counting Markov Equivalence Classes by Number of Immoralities
• Cardinalities of the total number of independent sets
• Counting Markov Equivalence Classes for DAG models on Trees
• Code-based [3,1]-avoiders in finite affine spaces AG(n,2)
• ALLSAT compressed with wildcards: All, or all maximum independent sets