Conditional Fault Hamiltonicity of the Star Graph

dc.citation.epage	127	en_US
dc.citation.issue		en_US
dc.citation.spage	111	en_US
dc.citation.volume	113	en_US
dc.citation.woscount	0
dc.contributor.author	Lin, Cheng-Kuan	en_US
dc.contributor.author	Tan, Jimmy J. M.	en_US
dc.contributor.author	Hsu, Lih-Hsing	en_US
dc.contributor.author	Cheng, Eddie	en_US
dc.contributor.author	Liptak, Laszlo	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.date.accessioned	2014-12-08T15:34:35Z
dc.date.available	2014-12-08T15:34:35Z
dc.date.issued	2014-01-01	en_US
dc.description.abstract	Fault tolerance is an important property on network performance. A graph G is k-edge-fault conditional hamiltonian if G - F is hamiltonian for every F subset of E(G) with vertical bar F vertical bar <= k and delta(G - F) >= 2. In this paper we show that for n >= 4 the n-dimensional star graph S-n is (3n - 10)-edge-fault conditional hamiltonian.	en_US
dc.identifier.issn	0381-7032	en_US
dc.identifier.journal	ARS COMBINATORIA	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/23614
dc.identifier.wosnumber	WOS:000329883500010
dc.language.iso	en_US	en_US
dc.subject	hamiltonian	en_US
dc.subject	star graphs	en_US
dc.subject	fault-tolerant	en_US
dc.title	Conditional Fault Hamiltonicity of the Star Graph	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1