For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic}  if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$  defined as $f^+(v) = sum f(uv)$ ...

Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied ...

Let $G$ be a $(p,q)$ graph. Let $f:V(G)to{1,2, ldots, k}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $gcd(f(u),f(v))$. $f$ is called $k$-Total prime cordial labeling of $G$ if ...

In this paper, a linear optimization problem is investigated whose constraints are defined with fuzzy relational inequality. These constraints are formed as the intersection of two inequality fuzzy systems and Schweizer-Sklar ...

In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of ...

In this  paper, we consider an  inverse eigenvalue problem (IEP) for constructing  a special  kind of acyclic matrices. The problem involves the reconstruction of matrices whose graph is a  banana tree. This is performed ...

In this study, single machine scheduling with flexible maintenance is investigated with non-resumable jobs by minimizing the weighted number of tardy jobs. It is assumed that the machine stops for a constant interval time ...

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