Hamiltonian Laceability in Line Graphs.

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Manjunatha, G.	-
dc.contributor.author	Murali, R.	-
dc.contributor.author	Girisha, A.	-
dc.date.accessioned	2019-01-13T09:09:15Z	-
dc.date.available	2019-01-13T09:09:15Z	-
dc.date.issued	2014-07	-
dc.identifier.citation	Manjunatha, G., Murali, R., & Girisha, (2014). A hamiltonian laceability in line graphs. International Journal of Computer Applications, 98(12), 17-25.	en_US
dc.identifier.issn	0975 – 8887	-
dc.identifier.uri	http://13.232.72.61:8080/jspui/handle/123456789/914	-
dc.description.abstract	A Connected graph G is a Hamiltonian laceable if there exists in G a Hamiltonian path between every pair of vertices in G at an odd distance. G is a Hamiltonian-t-Laceable (Hamiltoniant- Laceable) if there exists in G a Hamiltonian path between every pair (at least one pair) of vertices at distance‘t’ in G. 1≤ t ≤ diamG. In this paper we explore the Hamiltonian-t- laceability number (  ) t  of graph L (G) i.e., Line Graph of G and also explore Hamiltonian-t-Laceable of Line Graphs of Sunlet graph, Helm graph and Gear graph for t=1,2 and 3.	en_US
dc.language.iso	en	en_US
dc.publisher	International Journal of Computer Applications	en_US
dc.subject	Mathematics	en_US
dc.subject	Connected graph	en_US
dc.subject	Sun let graph	en_US
dc.subject	Helm graph	en_US
dc.title	Hamiltonian Laceability in Line Graphs.	en_US
dc.type	Article	en_US
Appears in Collections:	Articles

Files in This Item:

File	Description	Size	Format
Hamilton_lace_inLineGraphs-2-10.pdf		782.85 kB	Adobe PDF	View/Open