In 2013 Ayman A. Hazaymeh in his PhD thesis introduced the concept of timefuzzy soft set as a generalization of fuzzy soft set. In this paper and as a generalization of neutrosoph...
In order to deal with the difficulty of ranking interval numbers in the multiple attribute decision making process, interval numbers are expressed in the Rectangular Coordinate Sy...
We study choosability with separation which is a constrained version of list coloring of graphs. A (k, d)-list assignment L of a graph G is a function that assigns to each vertex ...
The global mean of subtrees of a tree is the average order (i.e., average number of vertices) of its subtrees. Analogously, the local mean of a vertex in a tree is the average orde...
: A perfect matching covering of a graph G is a set of perfect matchings of G such that every edge of G is contained in at least one member of it. Berge conjectured that every brid...