Let $G$ be a graph. Let $f:Vleft(Gright)rightarrow left{0,1,2,ldots,k-1right}$ be a function where $kin mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $fleft(uvright)=leftlceil frac{fleft(uright)+fleft(vr ...

Generally, no one can reject the fact that crypto currency market is expanded rapidly during last few years as, nowadays, crypto currency market is attractive for both traders and business who are not willing to pay for ...

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated whereby the feasible region is formed as the intersection of two inequality fuzzy systems and ...

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated whereby the feasible region is formed as the intersection of two inequality fuzzy systems and “Fuzzy ...

In this paper we show that, if $NPneq ZPP$, for any $epsilon > 0$, the tenacity of graphwith $n$ vertices is not approximable in polynomial time within a factor of$frac{1}{2} left( frac{n-1}{2} right) ^{1-epsilon}$.

Twelve well known `Recreational' numbers are generalized and classified in three generalized types Hardy, Dudeney, and Wells. A novel proof method to limit the search for the numbers is exemplified for each of the types. ...

Let $n$ and $k$ be integers such that $3leq 2k+ 1 leq n$.The generalized Petersen graph $GP(n, k)=(V,E) $ is the graph with $V={u_1, u_2,ldots, u_n}cup{v_1, v_2,ldots, v_n}$ and $E={u_iu_{i+1}, u_iv_i, v_iv_{i+k}: 1 leq i ...

One of the most popular frameworks for big data processing is Apache Hadoop MapReduce. The default Hadoop scheduler uses queue system. However, it does not consider any specific priority for the jobs required for MapReduce ...

Inverse eigenvalue problems (IEPs) of tridiagonal matrices are among the most popular IEPs, this is due to the widespread application of this matrix. In this paper, two different IEPs with different eigen information ...