**Volume 56 (2024)**

**Volume 55 (2023)**

**Volume 54 (2022)**

**Volume 53 (2021)**

**Volume 52 (2020)**

**Volume 51 (2019)**

**Volume 50 (2018)**

**Volume 49 (2017)**

**Volume 48 (2016)**

**Volume 47 (2016)**

**Volume 46 (2015)**

**Volume 45 (2014)**

**Volume 44 (2013)**

**Volume 43 (2009)**

**Volume 42 (2008)**

**Volume 41 (2007)**

Number of Articles: 12

##### Pair mean cordial labeling of graphs

*Volume 54, Issue 1 , June 2022, Pages 1-10*

#####
**Abstract **

In this paper, we introduce a new graph labeling called pair mean cordial labeling of graphs. Also, we investigate the pair mean cordiality of some graphs like path, cycle, complete graph, star, wheel, ladder, and comb.
Read More
##### A comparison between the resolution and linear optimization of FREs defined by product t-norm and geometric mean operator

*Volume 54, Issue 1 , June 2022, Pages 11-22*

#####
**Abstract **

In this paper, a type of fuzzy system is firstly investigated whereby the feasible region is defined by the fuzzy relational equalities and the geometric mean as fuzzy composition. Some related basic and theoretical properties of such fuzzy relational equations are derived and the feasible region is ...
Read More
##### Developing a New Genetic Algorithm for Selecting Efficient Project Portfolio

*Volume 54, Issue 1 , June 2022, Pages 23-34*

#####
**Abstract **

selecting an efficient project portfolio among available projects is a vital decision for any project manager. The main questions are which projects can have more long-term benefits for managers or organizations. Due to the complexity of this field of research, today so many approaches are developed ...
Read More
##### $4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$

*Volume 54, Issue 1 , June 2022, Pages 35-46*

#####
**Abstract **

Let $G$ be a graph. Let $f:V\left(G\right)\rightarrow \left\{0,1,2,\ldots,k-1\right\}$ be a function where $k\in \mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $f\left(uv\right)=\left\lceil \frac{f\left(u\right)+f\left(v\right)}{2}\right\rceil$. $f$ is called $k$-total mean cordial labeling ...
Read More
##### A Survey on Tenacity Parameter\\Part II

*Volume 54, Issue 1 , June 2022, Pages 47-72*

#####
**Abstract **

In this paper, we study the edge tenacity of graphs. We will be primarilyinterested in edge-tenacious graphs, which can be considered very stable and are somewhat analogous in edge tenacityto honest graphs in edge-integrity. We show several results about edge-tenacious graphs as well asfind numerous ...
Read More
##### Comparison of solutions resulted from direct problems formulated as FRE

*Volume 54, Issue 1 , June 2022, Pages 73-87*

#####
**Abstract **

In this paper, we investigate direct solution of FRE and compare their results with expected real consequences. We give an applied example formulated by a FRE problem and show that FRE defined by maximum t-conorm and an arbitrary t-norm can yield different interpretations for our example. A necessary ...
Read More
##### Approximating the Number of Lattice Points inside a Regular Polygon

*Volume 54, Issue 1 , June 2022, Pages 89-98*

#####
**Abstract **

We study the problem of counting the number of lattice points inside a regular polygon with $n$ sides when its center is at the origin and present an exact algorithm with $\mathcal{O}(k^{2}\log n)$ time and two approximate answers for this problem, where $k$ is the absolute value of side length of the ...
Read More
##### Relative Clustering Coefficient

*Volume 54, Issue 1 , June 2022, Pages 99-108*

#####
**Abstract **

In this paper, we relatively extend the definition of the global clustering coefficient to another clustering, which we call it \emph{relative clustering coefficient}. The idea of this definition is to ignore the edges in the network that the probability of having an edge is $0$. Here, we also consider ...
Read More
##### An iterative method and maximal solution of Coupled algebraic Riccati equations

*Volume 54, Issue 1 , June 2022, Pages 109-123*

#####
**Abstract **

Coupled Riccati equation has widely been applied to various engineering areas such as jump linear quadratic problem, particle transport theory, and Wiener–Hopf decomposition of Markov chains. In this paper, we consider an iterative method for computing the Hermitian solution of the Coupled Algebraic ...
Read More
##### Speeding up the Arc Consistency algorithm in Constraint Satisfaction Problems: A New Modification of AC-3

*Volume 54, Issue 1 , June 2022, Pages 125-138*

#####
**Abstract **

Dealing with constraints is always very common in real-world implementation issues. Search algorithms for real problems are also no exception. Because of the constraints in search problems (named Constraint Satisfaction Problems (CSPs)), their main solving algorithm is presented in backtracking form. ...
Read More
##### Optimizing Insurance Contract for a two-level two-period Supply Chain

*Volume 54, Issue 1 , June 2022, Pages 139-174*

#####
**Abstract **

We can apply any method for organizing a supply chain, but contracting is more viable. Among many contracts that does so, the Insurance contract is more efficient. The problem is tuning the contract's parameters (for a two-level two-period supply chain with one supplier and one retailer) to achieve the ...
Read More
##### On the resolution of LP-FRE defined by the convex combination operator

*Volume 54, Issue 1 , June 2022, Pages 175-186*