Kn(?) is fully {P7, S4}-decomposable

Chinnavedi, R.; Sangeetha, R.

dc.contributor.author	Chinnavedi, R.	en_US
dc.contributor.author	Sangeetha, R.	en_US
dc.date.accessioned	2022-01-16T22:37:26Z
dc.date.available	2022-01-16T22:37:26Z
dc.date.issued	2022
dc.identifier.citation	Chinnavedi, R. & Sangeetha, R. (2022). Kn(λ) is fully {P7, S4}-decomposable. TWMS Journal Of Applied And Engineering Mathematics, 12(1), 149-156.	en_US
dc.identifier.issn	2146-1147	en_US
dc.identifier.issn	2587-1013	en_US
dc.identifier.uri	https://hdl.handle.net/11729/3395
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/114-vol12no1/801
dc.description.abstract	Let Pk+1 denote a path of length k, Sm denote a star with m edges, and Kn(?) denote the complete multigraph on n vertices in which every pair of distinct vertices is joined by ? edges. In this paper, we have obtained the necessary conditions for a {Pk+1, Sm}-decomposition of Kn(?) and proved that the necessary conditions are also sufficient when k = 6 and m = 4.	en_US
dc.description.sponsorship	The second author is supported by the University of New Delhi under the grant no: F. MRP-6292/15, (SERO/UGC).	en_US
dc.language.iso	en	en_US
dc.publisher	Işık University Press	en_US
dc.relation.ispartof	TWMS Journal Of Applied And Engineering Mathematics	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Complete multigraph	en_US
dc.subject	Decomposition	en_US
dc.subject	Path	en_US
dc.subject	Star	en_US
dc.title	Kn(?) is fully {P7, S4}-decomposable	en_US
dc.type	Article	en_US
dc.description.version	Publisher's Version	en_US
dc.identifier.volume	12
dc.identifier.issue	1
dc.identifier.startpage	149
dc.identifier.endpage	156
dc.peerreviewed	Yes	en_US
dc.publicationstatus	Published	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US