Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 30184
On Minimum Cycle Bases of the Wreath Product of Wheels with Stars

Authors: M. M. M. Jaradat, M. K. Al-Qeyyam

Abstract:

The length of a cycle basis of a graph is the sum of the lengths of its elements. A minimum cycle basis is a cycle basis with minimum length. In this work, a construction of a minimum cycle basis for the wreath product of wheels with stars is presented. Moreover, the length of minimum cycle basis and the length of its longest cycle are calculated.

Keywords: Cycle space, minimum cycle basis, wreath product.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1332658

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 742

References:


[1] K.M. Al-Qeyyam and M.M.M. Jaradat, On the basis number and the minimum cycle bases of the wreath product of some graphs II, (To appear in JCMCC).
[2] L.O. Chua and L. Chen, On optimally sparse cycles and coboundary basis for a linear graph, IEEE Trans. Circuit Theory, 20, 54-76 (1973).
[3] G.M. Downs, V.J. Gillet, J.D. Holliday and M.F. Lynch, Review of ring perception algorithms for chemical graphs, J. Chem. Inf. Comput. Sci., 29, 172-187 (1989).
[4] F. Harary, "Graph theory", Addison-Wesley Publishing Co., Reading, Massachusetts, 1971.
[5] M.M.M. Jaradat, On the basis number and the minimum cycle bases of the wreath product of some graphs I, Discussiones Mathematicae Graph Theory 26, 113-134 (2006).
[6] M.M.M. Jaradat, M.Y. Alzoubi and E.A. Rawashdeh, The basis number of the Lexicographic product of different ladders, SUT Journal of Mathematics 40(2), 91-101 (2004).
[7] M.M.M. Jaradat and M.K. Al-Qeyyam, On the basis number and the minimum cycle bases of the wreath product of wheels. International Journal of Mathematical combinatorics, Vol. 1 (2008), 52-62 (2008).
[8] A. Kaveh, Structural Mechanics, Graph and Matrix Methods. Research Studies Press, Exeter, UK, 1992.
[9] D.J.A. Welsh, Kruskal-s theorem for matroids, Proc. Cambridge Phil, Soc., 64, 3-4 (1968).