Counting spanning trees in the graphs of Kleitman and Golden and a generalization

Abstract A new calculation is given for the number of spanning trees in a family of labelled graphs considered by Kleitman and Golden, and for a more general class of such graphs.