Hamiltonian Laceability in Cyclic Product and Brick Product of Cycles.

Please use this identifier to cite or link to this item: http://13.232.72.61:8080/jspui/handle/123456789/544

Full metadata record

DC Field	Value	Language
dc.contributor.author	Girisha, A.	-
dc.contributor.author	Murali, R.	-
dc.date.accessioned	2018-12-06T12:20:09Z	-
dc.date.available	2018-12-06T12:20:09Z	-
dc.date.issued	2013-02	-
dc.identifier.citation	Girisha. A., & Murali, R. (2013). Hamiltonian laceability in cyclic product and brick product of cycles. International Journal of Graph Theory, 1(1), 32-40.	en_US
dc.identifier.issn	2320 – 6543	-
dc.identifier.uri	http://13.232.72.61:8080/jspui/handle/123456789/544	-
dc.description.abstract	A connected graph G is said to be Hamiltonian-t-laceable if there exists a Hamiltonian path between every pair of distinct vertices at a distance‘t’ in G and Hamiltonian-t-laceable if there exist at least one such pair, where t is a positive integer. In this paper we explore Hamiltonian-t- Laceability properties of the cyclic product C(2n, m) and the Brick product C(2n+1, 3, 2) of cycles.	en_US
dc.language.iso	en	en_US
dc.publisher	Shihan International Publications.	en_US
dc.subject	Mathematics	en_US
dc.subject	Cyclic product	en_US
dc.subject	Brick product	en_US
dc.title	Hamiltonian Laceability in Cyclic Product and Brick Product of Cycles.	en_US
dc.type	Article	en_US
Appears in Collections:	Articles

Files in This Item:

File	Description	Size	Format
HAMILTONIAN LACEABILITYIN CYCLIC PRODUCT AND BRICK.pdf		699.78 kB	Adobe PDF	View/Open