Please use this identifier to cite or link to this item: http://hdl.handle.net/123456789/82
Full metadata record
DC FieldValueLanguage
dc.contributor.authorK. S. PARVATHY, A. VIJAYAKUMAR-
dc.date.accessioned2016-11-08T06:58:35Z-
dc.date.available2016-11-08T06:58:35Z-
dc.date.issued2007-10-01-
dc.identifier.urihttp://hdl.handle.net/123456789/82-
dc.description.abstractIn this paper, a convexity for the edge set of a graph G = (V, E) is defined. It is a matroid of rank p — 1 where IV (G) I = p and its arity is not in general two. The classical convex invariants are also evaluated.en_US
dc.language.isoenen_US
dc.publisherIndian J. pure appl. Mathen_US
dc.relation.ispartofseries38(5): 451-456, October 2007;-
dc.subjectCyclic convexityen_US
dc.subjectedgematroiden_US
dc.subjectconvexity parametersen_US
dc.titleON THE CYCLIC CONVEXITY OF A GRAPHen_US
dc.typeArticleen_US
Appears in Collections:Dr.Parvathy K.S.

Files in This Item:
File Description SizeFormat 
ON THE CYCLIC CONVEXITY OF A GRAPH.PDF1.09 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.