On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs

DOI10.1016/j.dam.2012.01.008zbMath1239.05155OpenAlexW1510512919MaRDI QIDQ423977

Andrezej Włoch

Publication date: 30 May 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.01.008

zbMATH Keywords

counting\(k\)-independent setFibonacci numberLucas number\(H\)-matching

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (7)

The Fibonacci numbers of certain subgraphs of circulant graphs ⋮ Total graph interpretation of the numbers of the Fibonacci type ⋮ On a new type of distance Fibonacci numbers ⋮ On the connectivity properties and energy of Fibonomial graphs ⋮ Some identities for generalized Fibonacci and Lucas numbers ⋮ On a four-parameter generalization of some special sequences ⋮ On the Fibonacci numbers of the composition of graphs

Cites Work

• Combinatorial and computational aspects of graph packing and graph decomposition
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Generalized sequences and \(k\)-independent sets in graphs
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers
• Principles of combinatorics
• Theory of monomer-dimer systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs