On Rainbow k-Connection Number of Special Graphs and It’s Sharp Lower Bound

dc.contributor.author	Agustin, Ika Hesti
dc.date.accessioned	2019-12-23T02:59:54Z
dc.date.available	2019-12-23T02:59:54Z
dc.date.issued	Turnitin
dc.identifier.uri	http://ura.unej.ac.id/123456789/70931
dc.language.iso	en_US	en_US
dc.title	On Rainbow k-Connection Number of Special Graphs and It’s Sharp Lower Bound	en_US
dc.type	Other	en_US