Distance Fibonacci numbers, their interpretations and matrix generators

• Autorzy: Bednarz U. , Włoch A. , Wołowiec-Musiał M.
• Języki publikacji: EN

Abstrakty

EN

In this paper we define a distance Fibonacci numbers, also for negative integers, which generalize the classical Fibonacci numbers and Padovan numbers, simultaneously. We give different interpretations of these numbers with respect to special partitions and compositions, also in graphs. We show a construction of the sequence of distance Fibonacci numbers using the Pascal’s triangle. Moreover, we give matrix generators of these numbers, for negative integers, too.

Słowa kluczowe

EN

Fibonacci numbers; matching; covering; matrix generators

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Commentationes Mathematicae
• Rocznik: 2013
• Tom: Vol 53, No. 1
• Strony: 35--46
• Opis fizyczny: Bibliogr. 14 poz., tab.

Twórcy

autor

Bednarz U.

• Rzeszow University of Technology, Faculty of Mathematics and Applied Physics al. Powstanców Warszawy 12, 35-959 Rzeszów, Poland

autor

Włoch A.

• Rzeszow University of Technology, Faculty of Mathematics and Applied Physics al. Powstanców Warszawy 12, 35-959 Rzeszów, Poland

autor

Wołowiec-Musiał M.

• Rzeszow University of Technology, Faculty of Mathematics and Applied Physics al. Powstanców Warszawy 12, 35-959 Rzeszów, Poland

Bibliografia

• [1] C. Berge, Principles of combinatorics , Academic Press New York and London (1971).
• [2] R. Diestel, Graph theory, Springer-Verlag, Heidelberg, New York, Inc., 2005.
• [3] S. Falcon, On the powers of k-Fibonacci numbers, Ars Combinatoria, in print.
• [4] S. Falcon, A.Plaza, On k-Fibonacci numbers of arithmetic indexes, Applied Mathematics and Computation 208 (2009), 180–185.
• [5] H. Galeana-Sánchez, C. Hernández-Cruz, On the existence of (k,l)-kernels in infinite digraphs. A survey - submitted.
• [6] H. Galeana-Sánchez, C. Hernández-Cruz, k-kernels in generalizations of transitive digraphs, Discussiones Mathematicae Graph Theory 31 2 (2011), 293-312.
• [7] H. Galeana-Sánchez, C. Hernández-Cruz, Cyclically k-partite digraphs and k-kernels, Discussiones Mathematicae Graph Theory 31 1 (2011), 63-78.
• [8] I. Gutman, S.Wagner, Maxima and minima of the Hosoya index and the Merrifield-Simmons index. A survey of results and techniques, Acta Applicandae Mathematicae, 112/3 (2010) 323-346.
• [9] M. Kwasnik, I. Włoch, The total number of generalized stable sets and kernels in graphs, Ars Combinatoria 55 (2000) 139–146.
• [10] H. Prodinger and R.F. Tichy, Fibonacci numbers of graphs, Fibonacci Quart. 20 (1982), 1621.
• [11] I. Włoch, Trees with extremal numbers of maximal independet sets including the set of leaves, Discrete Mathematics 308 (2008), 4768–4772.
• [12] A. Włoch, I. Włoch, Generalized sequences and k-independent sets in graphs, Discrete Applied Mathematics 158 (2010), 1966–1970.
• [13] A. Włoch, I. Włoch, Generalized Padovan numbers, Perrin numbers and maximal kindependent sets in graphs, Ars Combinatoria, 99 (2011) 359-364.
• [14] A. Włoch, On generalized Fibonacci numbers and k-distance Kp-matchings in graphs, Discrete Applied Mathematics 160 (2012), 1399–1405.