The Basis Number of Quadruple Join of Graphs | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 19, Volume 9, Issue 1, June 2012, Pages 27-34 PDF (429.21 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2012.163685 | ||
| Authors | ||
| Ghassan T. Marougi1; Raghad A. Mustafa2 | ||
| 1College of Computer Sciences and Mathematics University of Mosul | ||
| 2College of Computer Sciences and Mathematics University of Mosul, Iraq | ||
| 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, then The basis number of quadruple join of paths, are studied. It is proved that | ||
| Keywords | ||
| Basis Number; Cycle space | ||
|
Statistics Article View: 203 PDF Download: 209 |
||