Contents

-

(k,αn1)-Fibonacci Numbers and Pk-Matchings in Multigraphs

Urszula Bednarz1, Dorota Bréd2, Krzysztof Piejko2, Andrzej Wioch2
1
2Rzeszow University of Technology Faculty of Mathematics and Applied Physics al. Powstaricéow Warszawy 12, 35-359 Rzeszéw, Poland

Abstract

In this paper we generalize the Fibonacci numbers and the Lucas numbers with respect to n, respectively n+1 parameters. Using these definitions we count special subfamilies of the set of n integers. Next we give the graph interpretations of these numbers with respect to the number of Pk,-matchings in special graphs and we apply it for proving some identity and also for counting other subfamilies of the set of n integers.