Loop designs

Please use this identifier to cite or link to this item: https://ir.swu.ac.th/jspui/handle/123456789/14487

Full metadata record

DC Field	Value	Language
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.identifier.issn	8353026
dc.identifier.other	2-s2.0-79960767967
dc.identifier.uri	https://ir.swu.ac.th/jspui/handle/123456789/14487	-
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-79960767967&partnerID=40&md5=dbf56795e2bc632f48b67e0452032e9a
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.subject	BIBD
dc.subject	Graph design
dc.subject	LD
dc.subject	Loop design
dc.subject	Subgraphs
dc.subject	Design
dc.title	Loop designs
dc.type	Article
dc.rights.holder	Scopus
dc.identifier.bibliograpycitation	Journal of Combinatorial Mathematics and Combinatorial Computing. Vol 78, No. (2011), p.261-272
Appears in Collections:	Scopus 1983-2021

Files in This Item:

There are no files associated with this item.