Hamiltonian decomposition of generalized recursive circulant graphs

doi:10.1016/j.ipl.2016.04.003

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Chen, Y-Chuang	en_US
dc.contributor.author	Tsai, Tsung-Han	en_US
dc.date.accessioned	2017-04-21T06:56:32Z	-
dc.date.available	2017-04-21T06:56:32Z	-
dc.date.issued	2016-09	en_US
dc.identifier.issn	0020-0190	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/j.ipl.2016.04.003	en_US
dc.identifier.uri	http://hdl.handle.net/11536/133866	-
dc.description.abstract	In 2012, Tang et al. [9] proposed a new class of graphs called generalized recursive circulant (GRC) graphs, which is an extension of recursive circulant graphs. GRC graphs have a more flexible structure than recursive circulant graphs, while retaining their attractive properties, such as degree, connectivity, diameter, and routing algorithm. In this paper, the Hamiltonian decomposition of some GRC graphs is discussed. (C) 2016 Elsevier B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	Fault tolerance	en_US
dc.subject	Hamiltonian decomposition	en_US
dc.subject	Circulant graph	en_US
dc.subject	Recursive circulant graph	en_US
dc.subject	Generalized recursive circulant graph	en_US
dc.title	Hamiltonian decomposition of generalized recursive circulant graphs	en_US
dc.identifier.doi	10.1016/j.ipl.2016.04.003	en_US
dc.identifier.journal	INFORMATION PROCESSING LETTERS	en_US
dc.citation.volume	116	en_US
dc.citation.issue	9	en_US
dc.citation.spage	585	en_US
dc.citation.epage	589	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:000377736400009	en_US
顯示於類別：	期刊論文