Ring embedding in faulty pancake graphs

doi:10.1016/S0020-0190(02)00510-0

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Hung, CN	en_US
dc.contributor.author	Hsu, HC	en_US
dc.contributor.author	Liang, KY	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)00510-0	en_US
dc.identifier.uri	http://hdl.handle.net/11536/27789	-
dc.description.abstract	In this paper, we consider the fault hamiltonicity and the fault hamiltonian connectivity of the pancake graph P-n. Assume that F subset of or equal to V(P-n) boolean OR E(P-n). For n greater than or equal to 4, we prove that P-n - F is hamiltonian if F less than or equal to (n - 3) and P-n - F is hamiltonian connected if F less than or equal to (n - 4). Moreover, all the bounds are optimal. (C) 2003 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	fault tolerance	en_US
dc.subject	Hamiltonian	en_US
dc.subject	Hamiltonian connected	en_US
dc.subject	pancake graphs	en_US
dc.title	Ring embedding in faulty pancake graphs	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0020-0190(02)00510-0	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	271	en_US
dc.citation.epage	275	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000182959700007	-
dc.citation.woscount	14	-
顯示於類別：	期刊論文

文件中的檔案：

000182959700007.pdf

若為 zip 檔案，請下載檔案解壓縮後，用瀏覽器開啟資料夾中的 index.html 瀏覽全文。