Hamiltonian Laceability in Cone Product Graphs.

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Girisha, A.	-
dc.contributor.author	Murali, R.	-
dc.date.accessioned	2018-12-06T12:19:38Z	-
dc.date.available	2018-12-06T12:19:38Z	-
dc.date.issued	2013-06	-
dc.identifier.citation	Girisha, A., & Murali R. (2013). Hamiltonian laceability in cone product graphs. International Journal of Research in Engineering Science & Advanced Technology, 3(2), 95-99.	en_US
dc.identifier.issn	2319-328X	-
dc.identifier.uri	http://13.232.72.61:8080/jspui/handle/123456789/541	-
dc.description.abstract	A connected graph G is said to be Hamiltoniant- 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 Cone product Cp(n), Ring product R(2n, 2n, 1) and the Cg –product Cg(n, mk) graphs, where m ≥ 2 and n, k are positive integers.	en_US
dc.language.iso	en	en_US
dc.publisher	IJREST.	en_US
dc.subject	Mathematics	en_US
dc.subject	Cyclic product	en_US
dc.subject	Cone product	en_US
dc.title	Hamiltonian Laceability in Cone Product Graphs.	en_US
dc.type	Article	en_US
Appears in Collections:	Articles

Files in This Item:

File	Description	Size	Format
Hamiltonian Laceability in Cone Product graphs-2-6.pdf		613.41 kB	Adobe PDF	View/Open