Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
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)
$Z_k$-Magic Labeling of Some Families of Graphs

P. Jeyanthi; K. Jeyadaisy

Volume 50, issue 2 , December 2018, Pages 1-12

https://doi.org/10.22059/jac.2018.69046

Abstract
  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)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-\textit{magic} ...  Read More

Linear programming on SS-fuzzy inequality constrained problems

Amin Ghodousian; shahrzad oveisi

Volume 50, issue 2 , December 2018, Pages 13-36

https://doi.org/10.22059/jac.2018.69466

Abstract
  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 family of t-norms. Schweizer-Sklar family of t-norms is a parametric family ...  Read More

Snakes and Caterpillars in Graceful Graphs

Christian Barrientos; Sarah M Minion

Volume 50, issue 2 , December 2018, Pages 37-47

https://doi.org/10.22059/jac.2018.69503

Abstract
  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 here to replace some paths with some trees with a more complex structures. Two ...  Read More

$4$-Total prime cordial labeling of some cycle related graphs

R Ponraj; J Maruthamani

Volume 50, issue 2 , December 2018, Pages 49-57

https://doi.org/10.22059/jac.2018.69777

Abstract
  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 $\left|t_{f}(i)-t_{f}(j)\right|\leq 1$, $i,j \in \{1,2, \cdots,k\}$ where $t_{f}(x)$ ...  Read More

LP problems constrained with D-FRIs

A. Ghodousian; M. Jafarpour

Volume 50, issue 2 , December 2018, Pages 59-79

https://doi.org/10.22059/jac.2018.69778

Abstract
  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 family of t-norms is considered as fuzzy composition. Dombi family of t-norms includes ...  Read More

Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time

Dara Moazzami; Niloofar Vahdat

Volume 50, issue 2 , December 2018, Pages 81-87

https://doi.org/10.22059/jac.2018.69783

Abstract
  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 interval graphs are polynomial. In this paper, two different vulnerability parameters ...  Read More

Inverse eigenvalue problem for matrices whose graph is a banana tree

Maryam Babaei Zarch; Seyed Abolfazl Shahzadeh Fazeli; Seyed Mehdi Karbassi

Volume 50, issue 2 , December 2018, Pages 89-101

https://doi.org/10.22059/jac.2018.69994

Abstract
  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 by using the  minimal and maximal eigenvalues of all  ...  Read More

Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time

Fatemeh Ganji; Amir Jamali

Volume 50, issue 2 , December 2018, Pages 103-119

https://doi.org/10.22059/jac.2018.70449

Abstract
  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 during the scheduling period to perform maintenance. In other words, the starting ...  Read More

Sign Test for Fuzzy Random Variables

Mehdi Shams; Gholamreza Hesamian

Volume 50, issue 2 , December 2018, Pages 121-139

https://doi.org/10.22059/jac.2018.70450

Abstract
  This paper extends the sign test to the case where data are observations of fuzzy random variables, and the hypotheses are imprecise rather than crisp. In this approach, first a new notion of fuzzy random variables is introduced. Then, the $\alpha$-level sets of the imprecise observations are transacted ...  Read More

Changes in Artificial Neural Network Learning Parameters and Their Impact on Modeling Error Reduction

Somayeh Mehrabadi

Volume 50, issue 2 , December 2018, Pages 141-155

https://doi.org/10.22059/jac.2018.70904

Abstract
  The main objective of this research is to investigate the effect of neural network architecture parameters on model behavior. Neural network architectural factors such as training algorithm, number of hidden layer neurons, data set design in training stage and the changes made to them, and finally its ...  Read More