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