Brother trees: A family of optimal 1(p)-hamiltonian and 1-edge hamiltonian graphs

doi:10.1016/S0020-0190(02)00509-4

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kao, SS	en_US
dc.contributor.author	Hsu, LH	en_US
dc.date.accessioned	2014-12-08T15:40:46Z	-
dc.date.available	2014-12-08T15:40:46Z	-
dc.date.issued	2003-06-15	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0020-0190(02)00509-4	en_US
dc.identifier.uri	http://hdl.handle.net/11536/27790	-
dc.description.abstract	In this paper we propose a family of cubic bipartite planar graphs, brother trees, denoted by BT(n) with n greater than or equal to 2. Any BT(n) is hamiltonian. It remains hamiltonian if any edge is deleted. Moreover, it remains hamiltonian when a pair of nodes (one from each partite set) is deleted. These properties are optimal. Furthermore, the number of nodes in BT(n) is 6. 2(n) - 4 and the diameter is 2n + 1. (C) 2003 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	hamiltonian	en_US
dc.subject	diameter	en_US
dc.subject	complete binary tree	en_US
dc.subject	interconnection networks	en_US
dc.title	Brother trees: A family of optimal 1(p)-hamiltonian and 1-edge hamiltonian graphs	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0020-0190(02)00509-4	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	86	en_US
dc.citation.issue	5	en_US
dc.citation.spage	263	en_US
dc.citation.epage	269	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000182959700006	-
dc.citation.woscount	2	-
Appears in Collections:	Articles

Files in This Item:

000182959700006.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.