Yalgorithmic aspects of decomposition of some graphs

dc.contributor.guide	Gnana dhas N
dc.coverage.spatial
dc.creator.researcher	Franklin richard R
dc.date.accessioned	2017-05-25T05:27:50Z
dc.date.available	2017-05-25T05:27:50Z
dc.date.awarded	n.d
dc.date.completed	2014
dc.date.registered	n.d
dc.description.abstract	The theorem can be proved by the method of mathematical induction newline
dc.description.note
dc.format.accompanyingmaterial	DVD
dc.format.dimensions
dc.format.extent	x, 131
dc.identifier.uri	http://hdl.handle.net/10603/151137
dc.language	English
dc.publisher.institution	Department of Mathematics
dc.publisher.place	Tirunelveli
dc.publisher.university	Manonmaniam Sundaranar University
dc.relation	18
dc.rights	university
dc.source.university	University
dc.subject.keyword	complete tripartite graph
dc.subject.keyword	length atleast two
dc.subject.keyword	proved by induction
dc.title	Yalgorithmic aspects of decomposition of some graphs
dc.title.alternative
dc.type.degree	Ph.D.