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 2 K with a path, a cycle, a star, a wheel and a complete graph.

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 an upper bound for) (

No abstract

The basis number of a graph G is defined to be the least integer k such that G has a k-fold cycle basis. We investigate the basis number of symmetric difference of K2 with a ladder graph Lm , a circular ladder, and a Möbius ladder.

No abstract