Please use this identifier to cite or link to this item:
http://digitalrepository.fccollege.edu.pk/handle/123456789/1513
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Malik, Shabnam | - |
dc.contributor.author | Qureshi, Ahmad Mahmood | - |
dc.date.accessioned | 2022-04-21T07:40:18Z | - |
dc.date.available | 2022-04-21T07:40:18Z | - |
dc.date.issued | 2013-03-24 | - |
dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/1513 | - |
dc.description.abstract | We investigate here how far we can extend the notion of a Halin graph such that hamiltonicity is preserved. Let H = T [ C be a Halin graph, T being a tree and C the outer cycle. A k-Halin graph G can be obtained from H by adding edges while keeping planarity, joining vertices of H − C, such that G − C has at most k cycles. We prove that, in the class of cubic 3-connected graphs, all 14-Halin graphs are hamiltonian and all 7-Halin graphs are 1-edge hamiltonian. These results are best possible. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Halin graph, k-Halin graph, hamiltonian, k-edge hamiltonian | en_US |
dc.title | Hamiltonicity of cubic 3-connected k-Halin graphs | en_US |
Appears in Collections: | Mathematics Department |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
12-Electr. J. Comb. 20(1) (2013), P66.pdf | 336.75 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.