On k-graceful labeling of pendant edge extension of complete bipartite graphs

Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/4500

Full metadata record

DC Field	Value	Language
dc.contributor.author	Bhoumik, S.	-
dc.contributor.author	Mitra, S.	-
dc.date.accessioned	2019-12-11T09:33:38Z	-
dc.date.available	2019-12-11T09:33:38Z	-
dc.date.issued	2018	-
dc.identifier.uri	http://hdl.handle.net/123456789/4500	-
dc.description	Bhoumik S. On k-graceful labeling of pendant edge extension of complete bipartite graphs / S. Bhoumik S. Mitra // Algebra and Discrete Mathematics. - 2018. - Vol. 25. - Number 2. - Рp. 188-199	uk_UA
dc.description.abstract	For any two positive integers m, n, we denote the graph Km,n ⊙ K1 by G. Ma Ke-Jie proposed a conjecture [9] that pendant edge extension of a complete bipartite graph is a k- graceful graph for k > 2. In this paper we prove his conjecture for n 6 m < n2 + ⌊ k n ⌋ + r.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	ДЗ "ЛНУ імені Тараса Шевченка"	uk_UA
dc.relation.ispartofseries	математичні науки;	-
dc.subject	k-graceful labeling	uk_UA
dc.subject	complete bipartite graph	uk_UA
dc.subject	corona	uk_UA
dc.subject	1-crown	uk_UA
dc.title	On k-graceful labeling of pendant edge extension of complete bipartite graphs	uk_UA
dc.type	Article	uk_UA
Appears in Collections:	Algebra and Discrete Mathematics. - № 2 (25). - 2018

Files in This Item:

File	Description	Size	Format
224-3437-1-PB.pdf		352.82 kB	Adobe PDF	View/Open

DSpace JSPUI