Hamiltonian Properties of Generalized Halin Graphs

Please use this identifier to cite or link to this item: http://digitalrepository.fccollege.edu.pk/handle/123456789/1516

Full metadata record

DC Field	Value	Language
dc.contributor.author	Malik, Shabnam	-
dc.contributor.author	Qureshi, Ahmad Mahmood	-
dc.contributor.author	Zamfirescu, Tudor	-
dc.date.accessioned	2022-04-21T07:49:07Z	-
dc.date.available	2022-04-21T07:49:07Z	-
dc.date.issued	2009-04-01	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1516	-
dc.description.abstract	A Halin graph is a graph H = T ∪ C, where T is a tree with no vertex of degree two, and C is a cycle connecting the end-vertices of T in the cyclic order determined by a plane embedding of T. In this paper, we define classes of generalized Halin graphs, called k-Halin graphs, and investigate their Hamiltonian properties.	en_US
dc.language.iso	en_US	en_US
dc.title	Hamiltonian Properties of Generalized Halin Graphs	en_US
Appears in Collections:	Mathematics Department

Files in This Item:

File	Description	Size	Format
15-Canad. Math. Bull. 52 (3) (2009), 416-423.pdf		167.25 kB	Adobe PDF	View/Open

DSpace JSPUI