Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7617
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | R.G. Stanton | - |
dc.date.accessioned | 2024-02-27T06:20:33Z | - |
dc.date.available | 2024-02-27T06:20:33Z | - |
dc.date.issued | 2004 | - |
dc.identifier.uri | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7617 | - |
dc.description.abstract | We apply a solution for an empty-diagonal square to produce a design comprising 4 pairs, 6 triples, and 87 quadruples that covers every pair from a 17-element set exactly 4 times and is a minimal such covering using blocks of size not exceeding 4. | - |
dc.publisher | Bulletin of the Institute of Combinatorics and Its Applications | - |
dc.title | Application of an Empty-Diagonal Square | - |
dc.vol | Vol 42 | - |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Application of an Empty-Diagonal Square.pdf | 586.81 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.