Please use this identifier to cite or link to this item:
https://ir.swu.ac.th/jspui/handle/123456789/14487| Title: | Loop designs |
| Authors: | Hurd S.P. Sarvate D.G. Punnim N. |
| Keywords: | BIBD Graph design LD Loop design Subgraphs Design |
| Issue Date: | 2011 |
| 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. |
| URI: | https://ir.swu.ac.th/jspui/handle/123456789/14487 https://www.scopus.com/inward/record.uri?eid=2-s2.0-79960767967&partnerID=40&md5=dbf56795e2bc632f48b67e0452032e9a |
| ISSN: | 8353026 |
| Appears in Collections: | Scopus 1983-2021 |
Files in This Item:
There are no files associated with this item.
Items in SWU repository are protected by copyright, with all rights reserved, unless otherwise indicated.