On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs (Q423977): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Principles of combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima and minima of the Hosoya index and the Merrifield-Simmons index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3636189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized sequences and \(k\)-independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and computational aspects of graph packing and graph decomposition / rank
 
Normal rank

Latest revision as of 07:30, 5 July 2024

scientific article
Language Label Description Also known as
English
On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs
scientific article

    Statements

    On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs (English)
    0 references
    30 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Fibonacci number
    0 references
    Lucas number
    0 references
    \(H\)-matching
    0 references
    \(k\)-independent set
    0 references
    counting
    0 references
    0 references
    0 references