“…arises naturally from a graph theoretic question related to the expected number of independent sets of a graph [2]. Various properties, including asymptotics, zero distribution, and arithmetic properties, can be found in [1], [2], [3], and [9]. More recently, in [4], we extended the polynomials in (1.1) by introducing the class of polynomials where we typically fix the integer parameter m ≥ 1 and consider the sequence (f m,n (z)) n ; obviously f 2,n (z) = f n (z).…”