28
Voted
JIFS
2016
10 years 27 days ago
2016
In this study, we presented concept of neutrosophic cubic set by extending the concept of cubic set to neutrosophic set. We also defined internal neutrosophic cubic set (INCS) and...
30
Voted
JIFS
2016
10 years 27 days ago
2016
— Smarandache initiated neutrosophic sets (NSs) which can be used as a mathematical tool for dealing with indeterminate and inconsistent information. In order to apply NSs conven...
JIFS
2016
10 years 27 days ago
2016
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...
29
Voted
JIFS
2016
10 years 27 days ago
2016
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...
JGT
2016
10 years 27 days ago
2016
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 ...
JGT
2016
10 years 27 days ago
2016
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...
JGT
2016
10 years 27 days ago
2016
: 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...
JGT
2016
10 years 27 days ago
2016
We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all bu...
JGT
2016
10 years 27 days ago
2016
: Let λ2(G) and τ(G) denote the second largest eigenvalue and the maximum number of edge-disjoint spanning trees of a graph G, respectively. Motivated by a question of Seymour on...
JGT
2016
10 years 27 days ago
2016
We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with eO( √ log log n) colors such that the edges spanned by every set of five vertices receive at...