On generalized Fibonacci numbers and k-distance K_p-matchings in graphs
DOI10.1016/J.DAM.2012.01.008zbMATH Open1239.05155OpenAlexW1510512919MaRDI QIDQ423977FDOQ423977
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of monomer-dimer systems
- Principles of combinatorics
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers
- 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
- Combinatorial and computational aspects of graph packing and graph decomposition
Cited In (7)
- On the connectivity properties and energy of Fibonomial graphs
- On a four-parameter generalization of some special sequences
- The Fibonacci numbers of certain subgraphs of circulant graphs
- Total graph interpretation of the numbers of the Fibonacci type
- Some identities for generalized Fibonacci and Lucas numbers
- On the Fibonacci numbers of the composition of graphs
- On a new type of distance Fibonacci numbers
This page was built for publication: On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423977)
