Algorithms for compute independent sets of vertices in graphs and fuzzy graphs

Abstract

Among the remarkable sets of vertices of a graph, the independent sets of vertices (acronym IS, other name is the internal stabile sets of vertices) are important, because using them we can solve many classification: in chemistry, health, automobiles traffic, espionage, the chess game, the timetable problem. In this paper, some algorithms to compute the IS family of vertices are improved. A new kind of independents sets of vertices — fuzzy independent sets — related with fuzzy graphs, are defined, and algorithms for finding fuzzy independent sets family are given too.