Detecting monotonic graph over edge connectivity constraint

dc.contributor.author	Bhamaikar, A.A.
dc.contributor.author	Rao, P.R.
dc.date.accessioned	2015-06-04T03:08:14Z
dc.date.available	2015-06-04T03:08:14Z
dc.date.issued	2011
dc.identifier.citation	International Journal of Innovative Technology and Creative Engineering. 1; 2011; 1-5.	en_US
dc.identifier.uri	http://irgu.unigoa.ac.in/drs/handle/unigoa/2574
dc.identifier.uri	http://ia800305.us.archive.org/34/items/IJITCE/Dec11-1.pdf
dc.description.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
dc.publisher	IJAET	en_US
dc.subject	Computer Science and Technology	en_US
dc.title	Detecting monotonic graph over edge connectivity constraint	en_US
dc.type	Journal article	en_US