A Novel Description of Some Concepts in Interval-Valued Intuitionistic Fuzzy Graph with an Application

Algorithm 1

Finding the maximal SISs of containing an arbitrary vertex .

Step 1. Consider vertex as a member of . Then, remove all adjacent vertices of .

Step 2. Consider another arbitrary vertex in the remaining graph as a new member of .

Depending on which member of the remaining vertex set is selected, different independent sets, including , are obtained.

Step 3. Repeat Step 2 to select all possible vertices.