Generalized Padovan Numbers, Perrin Numbers and Maximal \(k\)-Independent Sets in Graphs

Abstract

In this paper, we give generalizations of Padovan numbers and Perrin numbers. We apply these generalizations for counting of special subsets of the set of \(n\) integers. Next, we give their graph representations with respect to the number of maximal \(k\)-independent sets in graphs.