We classify trivalent vertex-transitive graphs whose edge sets have a partition into 2-factor composed of two cycles and 1-factor that is invariant under the action automorphism group.

Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a serial and transitive relation on a universe, the collection of all the regular sets of the generalized rough set is a lattice. In this paper, we use the latt...

In this article, we introduce a new hybrid model called Dual Hesitant N-Soft Sets (DHNSS). This is clarified and reformulated as combination of dual hesitancy with N-soft sets. We investigate the basic operations DHNSS. Our novel illustrated real life examples. Moreover, propose decision making algorithm to see application model.

We present a new transitive closure algorithm that is based on strong component detection. The new algorithm is more eecient than the previous transitive closure algorithms that are based on strong components detection, since it does not generate unnecessary partial successor sets and scans the input graph only once.

A map of a circle is a continuous function from the circle to itself. Such a map is transitive if there is a point with a dense orbit. For degree one transitive maps of the circle with a fixed point, we give all possible sets of periods and the best lower bounds for topological entropy in terms of the set of periods.