http://hdl.handle.net/123456789/21 Asso. Professor 2026-06-02T10:43:15Z http://hdl.handle.net/123456789/425 Title: SOME CONVEXITY PROPERTIES OF NORMED SPACES Authors: PARVATHY K S 2016-05-01T00:00:00Z http://hdl.handle.net/123456789/83 Title: UNIFORMLY SEGREGATED TREES Authors: Jorry T.F, Parvathy K.S. Sr Abstract: In this paper family of Uniformly Segregated Trees (UST) and some of their properties are studied. The formula to find number of vertices for each k segregated tree is found. The increase in the number of vertices in Skin as of vertices of degree m increase is also determined. The method to construct higher (with regard to maximum degree) k-segregated trees from the lower k-segregated trees is discussed 2015-12-01T00:00:00Z http://hdl.handle.net/123456789/82 Title: ON THE CYCLIC CONVEXITY OF A GRAPH Authors: K. S. PARVATHY, A. VIJAYAKUMAR Abstract: In 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. 2007-10-01T00:00:00Z http://hdl.handle.net/123456789/81 Title: GEODESICITERATION NUMBER Authors: K.S.PARVATHY, A. VIJAYAKUMAR Abstract: In this paper we consider the geodesic iteration number and observe that .in contrast with the minimal path interaction number,there are interval monotone graphs G and Sc V(G)with|S|=3such that gin (S) is arbitrarily large. However join hull commutativity(JHC)property puts a bound on gin(S) is large. We also prove that,if G is a geodetic (JHC) graph then gain (G)=l. these concepts play a significant role in convexity of graphs. 2016-11-10T00:00:00Z