Track: Optimization
Abstract
This article discusses the characteristics of alpha-cut on fuzzy graph. Alpha-cut on fuzzy graph was introduced by Munoz (2005) for vertex coloring on fuzzy graph with crips vertices. It was continued by Arindam Dey, et all (2013) for the fuzzy set of vertices and edges. Alpha-cut on fuzzy graph is crips graphs Ga that are induced from fuzzy graph by removing all vertex and edges in fuzzy graphs that have a degree of membership less than ?, aÎ[0,1]. Therefore, the caracteristics of alpha-cut on fuzzy graph is related to the crips graph produced. Furthermorer alpha cut on fuzzy graph will produce many ways of scheduling.