For a connected graph G = (V, E), an edge monophonic set of G is a set M ⊆ V(G) such that every edge of G is contained in a monophonic path joining some pair of vertices in M. The edge monophonic number m 1 (G) of G is the minimum order of its edge monophonic sets and any edge monophonic set of order m 1 (G) is a minimum edge monophonic set of G. Connected graphs of order p with edge monophonic number p are characterized. Necessary condition for edge monophonic number to be p − 1 is given. It is shown that for every two integers a and b such that 2 ≤ a ≤ b, there exists a connected graph G with m(G) = a and m 1 (G) = b, where m(G) is the monophonic number of G.
--Optical Character Recognition plays an important role in Digital Image Processing and Pattern Recognition. Even though ambient study had been performed on foreign languages like Chinese and Japanese, effort on Indian script is still immature. OCR in Malayalam language is more complex as it is enriched with largest number of characters among all Indian languages. The challenge of recognition of characters is even high in handwritten domain, due to the varying writing style of each individual. In this paper we propose a system for recognition of offline handwritten Malayalam vowels. The proposed method uses Chain code and Image Centroid for the purpose of extracting features and a two layer feed forward network with scaled conjugate gradient for classification.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.