Publication: Loop designs
| dc.contributor.author | Hurd S.P. | |
| dc.contributor.author | Sarvate D.G. | |
| dc.contributor.author | Punnim N. | |
| dc.date.accessioned | 2021-04-05T03:35:08Z | |
| dc.date.available | 2021-04-05T03:35:08Z | |
| dc.date.issued | 2011 | |
| dc.date.issuedBE | 2554 | |
| dc.description.abstract | We show, for k = 3,4,5, that the necessary conditions are sufficient for the existence of graph designs which decompose Kv(λj), the complete (multi)graph on v points with λ multiple edges for each pair of points and j loops at each vertex, into ordered blocks (a1, a 2⋯, ak-1 a1)- Each block is the subgraph which contains both the set of unordered edges {ai, aj}, for each pair of consecutive edges in the ordered list, and also the loop at vertex a1. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.citation | Journal of Combinatorial Mathematics and Combinatorial Computing. Vol 78, No. (2011), p.261-272 | |
| dc.identifier.issn | 8353026 | |
| dc.identifier.other | 2-s2.0-79960767967 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14740/7269 | |
| dc.rights.holder | Scopus | |
| dc.subject.other | BIBD | |
| dc.subject.other | Graph design | |
| dc.subject.other | LD | |
| dc.subject.other | Loop design | |
| dc.subject.other | Subgraphs | |
| dc.subject.other | Design | |
| dc.title | Loop designs | |
| dc.type | Article | |
| dspace.entity.type | Publication | |
| swu.datasource.scopus | https://www.scopus.com/inward/record.uri?eid=2-s2.0-79960767967&partnerID=40&md5=dbf56795e2bc632f48b67e0452032e9a |