Coding and counting spanning trees in Kleitman-Golden graphs (Q4007354): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Fibonacci numbers via trigonometric expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Trees in a Certain Class of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix tree theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Proof of the All Minors Matrix Tree Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting spanning trees in the graphs of Kleitman and Golden and a generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning tree formulas and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Baxter algebras and combinatorial identities. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding and counting spanning trees in Kleitman-Golden graphs / rank
 
Normal rank

Latest revision as of 12:15, 16 May 2024

scientific article
Language Label Description Also known as
English
Coding and counting spanning trees in Kleitman-Golden graphs
scientific article

    Statements

    Coding and counting spanning trees in Kleitman-Golden graphs (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    Fibonacci numbers
    0 references
    spanning trees
    0 references
    Fibonacci sequence
    0 references
    direct coding
    0 references
    Kleitman-Golden graphs
    0 references
    words
    0 references