| dc.contributor | 應用數學系 | zh_TW |
| dc.creator (作者) | Fu, Chin-Mei;Huang, Wen-Chung;Tian, Jun-Yuan | en_US |
| dc.date (日期) | 2016-10 | |
| dc.date.accessioned | 15-Jan-2018 15:02:22 (UTC+8) | - |
| dc.date.available | 15-Jan-2018 15:02:22 (UTC+8) | - |
| dc.date.issued (上傳時間) | 15-Jan-2018 15:02:22 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/115569 | - |
| dc.description.abstract (摘要) | Two G-designsand (X,X2) are said to intersect in m blocks if [Ai n A2] = m. In this paper, we complete the solution of intersection problem for G-designs, where G is a connected graph of size five which contains a cycle. | en_US |
| dc.format.extent | 177 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Ars Combinatoria, 129, 185-198 | en_US |
| dc.title (題名) | G-designs having a prescribed number of blocks in common | en_US |
| dc.type (資料類型) | article | |
