Browse > Article
http://dx.doi.org/10.4134/BKMS.2007.44.3.385

AN UPPER BOUND OF THE BASIS NUMBER OF THE SEMI-STRONG PRODUCT OF CYCLES WITH BIPARTITE GRAPHS  

Jaradat, Mohammed M.M. (DEPARTMENT OF MATHEMATICS YARMOUK UNIVERSITY)
Publication Information
Bulletin of the Korean Mathematical Society / v.44, no.3, 2007 , pp. 385-394 More about this Journal
Abstract
An upper bound of the basis number of the semi-strong product of cycles with bipartite graphs is given. Also, an example is presented where the bound is achieved.
Keywords
basis number; cycle space; fold; semi-strong product;
Citations & Related Records

Times Cited By Web Of Science : 0  (Related Records In Web of Science)
Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 M. M. M. Jaradat, An upper bound of the basis number of the strong product of graphs, Discuss. Math. Graph Theory 25 (2005), no. 3, 391-406   DOI   ScienceOn
2 A. A. Ali, The basis number of complete multipartite graphs, Ars Combin. 28 (1989), 41-49
3 A. A. Ali and G. T. Marougi, The basis number of the Cartesian product of some graphs, J. Indian Math. Soc. (N.S.) 58 (1992), no. 1-4, 123-134
4 S. Y. Alsardary and J. Wojciechowski, The basis number of the powers of the complete graph, Discrete Math. 188 (1998), no. 1-3, 13-25   DOI   ScienceOn
5 J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, America Elsevier Publishing Co., Inc., New York, 1976
6 W.-K. Chen, On vector spaces associated with a graph, SIAM J. Appl. Math. 20 (1971), 525-529
7 W. Imrich and S. Klav.zar, Product Graphs, Structure and recognition. With a foreword by Peter Winkler. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience, New York, 2000
8 M. M. M. Jaradat, On the basis number of the direct product of graphs, Australas. J. Combin. 27 (2003), 293-306
9 M. M. M. Jaradat, The basis number of the strong product of trees and cycles with some graphs, J. Combin. Math. Combin. Comput. 58 (2006), 195-209
10 M. M. M. Jaradat and M. Y. Alzoubi, On the basis number of the semi-strong product of bipartite graphs with cycles, Kyungpook Math. J. 45 (2005), no. 1, 45-53
11 S. MacLane, A combinatorial condition for planar graphs, Fundamenta Math. 28 (1937), 22-32
12 E. F. Schmeichel, The basis number of a graph, J. Combin. Theory Ser. B 30 (1981), no. 2, 123-129   DOI
13 M. M. M. Jaradat, The basis number of the direct product of a theta graph and a path, Ars Combin. 75 (2005), 105-111
14 M. M. M. Jaradat and M. Y. Alzoubi, An upper bound of the basis number of the lexicographic product of graphs, Australas. J. Combin. 32 (2005), 305-312