We consider the maximum vertex-weighted matching problem (MVM) for non-bipartite graphs in which non-negative weights are assigned to vertices of a graph and that maximizes sum matched is desired. In earlier work we have described 2/3-approximation algorithm MVM on bipartite (Florin Dobrian et al., 2019). Here show can be obtained by restricting length augmenting paths at most three. The has ti...