Please use this identifier to cite or link to this item:
http://13.232.72.61:8080/jspui/handle/123456789/541| Title: | Hamiltonian Laceability in Cone Product Graphs. |
| Authors: | Girisha, A. Murali, R. |
| Keywords: | Mathematics Cyclic product Cone product |
| Issue Date: | Jun-2013 |
| Publisher: | IJREST. |
| 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. |
| 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. |
| URI: | http://13.232.72.61:8080/jspui/handle/123456789/541 |
| ISSN: | 2319-328X |
| 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 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.