Monophonic concepts in graphs

dc.contributor.guide	Titus T	en_US
dc.coverage.spatial	Monophonic concepts in graphs	en_US
dc.creator.researcher	Balakrishnan P	en_US
dc.date.accessioned	2015-02-10T11:49:21Z
dc.date.available	2015-02-10T11:49:21Z
dc.date.awarded	30/04/2014	en_US
dc.date.completed	01/04/2014	en_US
dc.date.issued	2015-02-10
dc.date.registered	n.d,	en_US
dc.description.abstract	For any two vertices x and y in a connected graph G an newlineX y path is a monophonic path if it contains no chord and a longest newlineX y monophonic path is called an x y detour monophonic path For newlineany vertex x in G newline newline	en_US
dc.description.note	reference p132-135.	en_US
dc.format.accompanyingmaterial	None	en_US
dc.format.dimensions	23cm.	en_US
dc.format.extent	xx, 136p.	en_US
dc.identifier.uri	http://hdl.handle.net/10603/34526
dc.language	English	en_US
dc.publisher.institution	Faculty of Science and Humanities	en_US
dc.publisher.place	Chennai	en_US
dc.publisher.university	Anna University	en_US
dc.relation	p132-135.	en_US
dc.rights	university	en_US
dc.source.university	University	en_US
dc.subject.keyword	Monophonic concepts in graphs	en_US
dc.title	Monophonic concepts in graphs	en_US
dc.title.alternative		en_US
dc.type.degree	Ph.D.	en_US