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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
