Abstract:
Edge Connectivity parameter of a given graph is widely used in graph mining and finds usage in wide range of applications like transportation problem , Microarray Data , Bioinformatics etc. Based upon the property of a given graph on edge connectivity constraint the decomposition of graph can be avoided, which in turn reduces computational time. The paper focuses at determining whether the given Graph (G) satisfies Monotone property over Edge Connectivity Constraint. It takes into consideration the Maximum degree, Minimum degree and Edge Connectivity values of given Graph (G), based on which the algorithm determines if the given graph satisfies Monotone Property
