Abstract
The basis number, b(G) ,of a graph G is defined to be the smallest positive integer k such that G has a k-fold basis for its cycle space. We investigate the basis number of semi-strong product of with a path, a cycle, a star, a wheel and a complete graph.