Decomposing complete graphs into K-r x K-c's

doi:10.1016/S0378-3758(02)00421-4

完整後設資料紀錄

DC 欄位	值	語言
dc.contributor.author	Fu, HL	en_US
dc.contributor.author	Hwang, FK	en_US
dc.contributor.author	Jimbo, M	en_US
dc.contributor.author	Mutoh, Y	en_US
dc.contributor.author	Shiue, CL	en_US
dc.date.accessioned	2014-12-08T15:39:40Z	-
dc.date.available	2014-12-08T15:39:40Z	-
dc.date.issued	2004-02-01	en_US
dc.identifier.issn	0378-3758	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0378-3758(02)00421-4	en_US
dc.identifier.uri	http://hdl.handle.net/11536/27092	-
dc.description.abstract	We consider the problem of decomposing a complete graph into the Cartesian product of two complete graphs K, and K, This problem originated from the clone library screening. We give a general method of constructing such decompositions using various sorts of combinatorial designs. In particular, for r = 3 and c = 3, we show that such a decomposition exists for all n satisfying some simple necessary conditions. (C) 2002 Elsevier B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	graph decomposition and grid-blocks	en_US
dc.subject	grid-block designs	en_US
dc.title	Decomposing complete graphs into K-r x K-c's	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0378-3758(02)00421-4	en_US
dc.identifier.journal	JOURNAL OF STATISTICAL PLANNING AND INFERENCE	en_US
dc.citation.volume	119	en_US
dc.citation.issue	2	en_US
dc.citation.spage	225	en_US
dc.citation.epage	236	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000186911900001	-
dc.citation.woscount	7	-
顯示於類別：	期刊論文

文件中的檔案：

000186911900001.pdf

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