Sciweavers

JIFS
2016
47views more  JIFS 2016»
10 years 27 days ago
Time-neutrosophic soft set and its applications
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...
Shawkat Alkhazaleh
JIFS
2016
47views more  JIFS 2016»
10 years 27 days ago
A method of ranking interval numbers based on degrees for multiple attribute decision making
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...
Yicheng Ye, Nan Yao, Qiaozhi Wang, Qihu Wang
JGT
2016
59views more  JGT 2016»
10 years 27 days ago
On Choosability with Separation of Planar Graphs with Forbidden Cycles
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 ...
Ilkyoo Choi, Bernard Lidický, Derrick Stole...
JGT
2016
53views more  JGT 2016»
10 years 27 days ago
On the Local and Global Means of Subtree Orders
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...
Stephan G. Wagner, Hua Wang
JGT
2016
59views more  JGT 2016»
10 years 27 days ago
On Perfect Matching Coverings and Even Subgraph Coverings
: 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...
Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang