Analyzation of Maximum Matching and Maximal Matching in Various Graphs

This paper presents the finding of Maximum Matching and Maximal Matching Cardinality in various Graphs G(V,E) where V is the set of Vertices and E is the set of Edges. Maximum Matching is the collection of Maximum non-adjacent edges. Maximal Matching is the collection of minimum possible collection of non- adjacent edges. Maximum Matching Cardinality implies the Maximum possible number of non-adjacent edges in the Graph. Maximal Matching Cardinality implies the minimum possible number of non-adjacent edges. Here it analyses which Graph proceeds the same value for Maximum Matching and Maximal Matching. It also tells
about the relation between the number of edges as well as the vertices and Maximum Matching Cardinality and Maximal Matching Cardinality by using the different Graphs.