Hyper hamiltonian laceability on edge fault star graph

doi:10.1016/j.ins.2003.09.023

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Li, TK	en_US
dc.contributor.author	Tar, JJM	en_US
dc.contributor.author	Hsu, LH	en_US
dc.date.accessioned	2014-12-08T15:38:32Z	-
dc.date.available	2014-12-08T15:38:32Z	-
dc.date.issued	2004-09-03	en_US
dc.identifier.issn	0020-0255	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.ins.2003.09.023	en_US
dc.identifier.uri	http://hdl.handle.net/11536/26383	-
dc.description.abstract	The star graph posses many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n - 3)-edge fault tolerant hamiltonian laceable, (n - 3)-edge fault tolerant strongly hamiltonian laceable, and (n - 4)-edge fault tolerant hyper hamiltonian laceable. All these results are optimal in a sense described in this paper. (C) 2003 Elsevier Inc. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	star graph	en_US
dc.subject	hamiltonian laceable	en_US
dc.subject	strongly hamiltonian laceable	en_US
dc.subject	hyper hamiltonian laceable	en_US
dc.subject	fault tolerant	en_US
dc.title	Hyper hamiltonian laceability on edge fault star graph	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/j.ins.2003.09.023	en_US
dc.identifier.journal	INFORMATION SCIENCES	en_US
dc.citation.volume	165	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	59	en_US
dc.citation.epage	71	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000223749900004	-
dc.citation.woscount	50	-
顯示於類別：	期刊論文

文件中的檔案：

000223749900004.pdf

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