On generalized Fibonacci numbers and k-distance K_p-matchings in graphs
From MaRDI portal
(Redirected from Publication:423977)
On generalized Fibonacci numbers and \(k\)-distance \(K p\)-matchings in graphs
On generalized Fibonacci numbers and \(k\)-distance \(K p\)-matchings in graphs
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)
Recommendations
- \((k,\alpha _{n-1})\)-Fibonacci numbers and \(P_k\)-matchings in multigraphs.
- Some interpretations of the generalized Fibonacci numbers
- Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers
- On generalized Pell numbers generated by Fibonacci and Lucas numbers.
- \(k\)-Fibonacci numbers and \(k\)-Lucas numbers and associated bipartite graphs
Cites work
- scientific article; zbMATH DE number 5572943 (Why is no real title available?)
- scientific article; zbMATH DE number 3745213 (Why is no real title available?)
- scientific article; zbMATH DE number 1792601 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 2197929 (Why is no real title available?)
- Combinatorial and computational aspects of graph packing and graph decomposition
- Generalized sequences and \(k\)-independent sets in graphs
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
- Principles of combinatorics
- Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers
- Theory of monomer-dimer systems
Cited in
(10)- Some interpretations of the generalized Fibonacci numbers
- On the Fibonacci numbers of the composition of graphs
- Some identities for generalized Fibonacci and Lucas numbers
- \((k,\alpha _{n-1})\)-Fibonacci numbers and \(P_k\)-matchings in multigraphs.
- 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 a four-parameter generalization of some special sequences
- Sequences of matchings in path-type graphs
- On the connectivity properties and energy of Fibonomial graphs
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)