An upper bound of the basis number of the semi-strong product of cycles with bipartite graphs

참고문헌 (14)

1. "The basis number of complete multipartite graphs" (1989)
2. "The basis number of the Cartesian product of some graphs", pp.1~4 (1992)
3. "The basis number of the powers of the completegraph", 188(1-3), pp.13~25 (1998)
4. "Graph Theory with Applications" (1976), America ElsevierPublishing Co Inc
5. "On vector spaces associated with a graph" (1971)
6. "Product Graphs, Structure and recognition;Wiley-Interscience Series in Discrete Mathematics and Optimization" (2000), Wiley-Interscience, New York
7. "On the basis number of the direct product of graphs", 27, pp.293~306 (2003)
8. "The basis number of the strong product of trees and cycles with some graphs", 58, pp.195~209 (2006)
9. "An upper bound of the basis number of the strong product of graphs", 25(3), pp.391~406 (2005)
10. "The basis number of the direct product of a theta graph and a path", 75, pp.105~111 (2005)
11. "An upper bound of the basis number of thelexicographic product of graphs", 32, pp.305~312 (2005)
12. "On the basis number of the semi-strong product of bipartite graphs with cycles", 45(1), pp.45~53 (2005)
13. "A combinatorial condition for planar graphs" (1937)
14. "The basis number of a graph" (1981)

관련 논문AI추천