Please use this identifier to cite or link to this item: http://13.232.72.61:8080/jspui/handle/123456789/542
Title: Hamiltonian Laceability in Ring Product and Cyclo Product of Graphs.
Authors: Girisha, A.
Murali, R.
Shanmukha, B.
Keywords: Mathematics
Cyclo product
Issue Date: May-2014
Publisher: Sciencedomain
Citation: Girisha, A., Murali, R., & Shanmukha, B. (2014). Hamiltonian Laceability in Ring Product and Cyclo Product of Graphs. British Journal of Mathematics & Computer Science, 4(13), 1857-1867.
Abstract: B. Alspach, C.C. Chen and Kevin Mc Avaney [1] have discussed the Hamiltonian laceability of the Brick product C(2n; m; r) for even cycles. In [2], the authors have shown that the (m; r)- Brick Product C(2n + 1; 1; 2) is Hamiltonian-t-laceable for 1 t diamn. In [3] the authors have defined and discussed Hamiltonian-t-laceability properties of cyclic product C(2n;m) cyclic product of graphs. In this paper we explore Hamiltonian-t -laceability of (W1;n; k) graph and Cyclo Product Cy(n;mk) of graph. Keywords: Brick product, Hamiltonian-t-laceable graph, .
URI: https://www.researchgate.net/profile/Dr_Girish3/publication/280095099_Hamiltonian_Laceability_in_Ring_Product_and_Cyclo_Product_of_Graphs/links/55a8bf5c08aea3d0867c606f.pdf
http://13.232.72.61:8080/jspui/handle/123456789/542
ISSN: 2231-0851
Appears in Collections:Articles

Files in This Item:
File Description SizeFormat 
Hamiltonian Laceability in Ring Product and Cyclo Product of graphs.pdf1.03 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.