The Basis Number of Quadruple Join of Graphs
AL-Rafidain Journal of Computer Sciences and Mathematics,
2012, Volume 9, Issue 1, Pages 27-34
10.33899/csmj.2012.163685
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 an upper bound for .It is proved that, if and are connected vertex-disjoint graphs and each has a spanning tree of vertex degree not more than 4, thenThe basis number of quadruple join of paths, are studied. It is proved that
Keywords:
- Article View: 42
- PDF Download: 49