The Basis Number of Quadruple Join of Graphs
Section: Research Paper
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
Identifiers
Download this PDF file
Statistics
How to Cite
A. Mustafa, R., & T. Marougi, G. (2012). The Basis Number of Quadruple Join of Graphs. AL-Rafidain Journal of Computer Sciences and Mathematics, 9(1), 27–34. https://doi.org/10.33899/csmj.2012.163685
Copyright and Licensing
This work is licensed under a Creative Commons Attribution 4.0 International License.
