An infinite family of graphs with a facile count of perfect matchings
Keywords: Cartesian product of graphs; k-matching; Perfect matching; Matching polynomial; Permanent; Contracted permanent; Hosoya index; Degree sequence; Immanant;