Abstract

The basis number b(G) of a graph G is defined to be the least integer k such that G has a k-fold basis for its cycle space. In this paper, we investigate the basis number of the composition of paths and cycles with ladders, circular ladders, and Möbius ladders.