We present an algorithm to generate bracelets with fixed content. An analysis shows that the algorithm runs in constant amortized time. The algorithm can be applied to efficiently list all non-isomorphic unicyclic graphs with n vertices.
The concept of trapezoidal valued hesitant fuzzy set is introduced. Notion for distance between any two trapezoidal valued hesitant fuzzy elements is given. Using this proposed distance measure, we extend the technique for order preference by similarity to ideal solution for trapezoidal valued hesitant fuzzy sets. An example is constructed to show… (More)