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)

$4$-total mean cordial labeling of special graphs

R Ponraj; S SUBBULAKSHMI; S Somasundaram

Volume 53, Issue 1 , June 2021, , Pages 13-22

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

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

Remarks on a rendering method for limit sets of Kleinian groups

alessandro rosa

Volume 54, Issue 2 , December 2022, , Pages 13-19

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

Abstract
  We revised our technique for generating graphical renderings of the limitsets of Kleinian groups. The algorithm, relying on numerical base conversion,has been improved to shorten computation times. This method easily applies toany family of Kleinian groups with an arbitrary number of generators.Following ...  Read More

Opinion Fraud Detection in Streaming Comments Utilising Node Similarity in the Review Network

Shahab Ghodsi; Ali Moieni

Volume 54, Issue 2 , December 2022, , Pages 21-35

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

Abstract
  One important criterion in decision-making when we want to purchase a product or a service is users’ reviews. When something is valuable, it’s fake and will be created as well. It is the same for users’ reviews. The purpose of these fake reviews is to deceive users, leading them to ...  Read More

A New Numerical Solution for System of Linear Equations

Iman Shojaei; Hossein Rahami

Volume 53, Issue 1 , June 2021, , Pages 23-39

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

Abstract
  In this paper we have developed a numerical method for solving system of linear equations through taking advantages of properties of repetitive tridiagonal matrices. A system of linear equations is usually obtained in the final step of many science and engineering problems such as problems involving ...  Read More

Crypto- Currency Price Prediction with Decision Tree Based Regressions Approach

ali naghib moayed; Reza Habibi

Volume 52, Issue 2 , December 2020, , Pages 29-40

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

Abstract
  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 FATF services for transferring money. With this in mind, crypto currency price prediction ...  Read More

Overlapping Clusters in Cluster Graph Convolutional Networks

Mahmood Amintoosi

Volume 53, Issue 2 , December 2021, , Pages 33-45

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

Abstract
  A popular research topic in Graph Convolutional Networks (GCNs) is to speedup the training time of the network. The main bottleneck in training GCN is the exponentially growing of computations. In Cluster-GCN based on this fact that each node and its neighbors are usually grouped in the same ...  Read More

$4$-total mean cordial labeling of union of some graphs with the complete bipartite graph $K_{2,n}$

R Ponraj; S SUBBULAKSHMI; S Somasundaram

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

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

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

Pair Difference Cordial Labeling of $m-$ copies of Path, Cycle, Star, and Ladder Graphs

R Ponraj; A Gayathri; Prof.Dr M.Sivakumar

Volume 54, Issue 2 , December 2022, , Pages 37-47

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

Abstract
  In this paper, we consider only finite, undirected, and simple graphs. The concept of cordial labeling was introduced by Cahit[4]. Different types of cordial-related labeling were studied in [1, 2, 3, 5, 16]. In a similar line, the notion of pair difference cordial labeling of a graph was introduced ...  Read More

A new meta-heuristic algorithm of giant trevally for solving engineering problems

Marjan Aliyari

Volume 55, Issue 1 , June 2023, , Pages 37-51

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

Abstract
  As science and technology is progressing in engineering problems are also getting much more complex. So, solving these problems is of pivotal concern. Besides, the optimal solution among the solutions is of great value. Among them, innovative algorithms inspired by artificial intelligence or the hunting ...  Read More

Implementation of Combinational Logic Circuits Using Nearest-Neighbor One-Dimensional Four-State Cellular Automata

Abolfazl Javan; Maryam Jafarpour; Ali Moieni; Mohammad Shekaramiz

Volume 52, Issue 2 , December 2020, , Pages 41-56

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

Abstract
  Cellular automata are simple mathematical idealizations of natural systems. They consist of a lattice of discrete identical sites, each site taking on a finite set of, say, integer values. Over the years, scientists have been trying to investigate the computational capabilities of cellular automata by ...  Read More

$\alpha$-Gap Greedy Spanner

Hosein Salami; Mostafa Nouri Baygi

Volume 53, Issue 1 , June 2021, , Pages 41-60

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

Abstract
  In this paper, we have introduced a new geometric spanner called $\alpha$-Gap greedy spanner, which is a parametric approximation of the well-known Gap-greedy spanner. We will show theoretically and experimentally that this spanner is similar to the Gap-greedy spanner in terms of qualitative features ...  Read More

Pair difference cordial labeling of planar grid and mangolian tent

R Ponraj; A Gayathri; S Somasundaram

Volume 53, Issue 2 , December 2021, , Pages 47-56

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

Abstract
   Let $G = (V, E)$ be a $(p,q)$ graph.Define \begin{equation*}\rho =\begin{cases}\frac{p}{2} ,& \text{if $p$ is even}\\\frac{p-1}{2} ,& \text{if $p$ is odd}\\\end{cases}\end{equation*}\\ and $L = \{\pm1 ,\pm2, \pm3 , \cdots ,\pm\rho\}$ called the set of labels.\noindent Consider a mapping ...  Read More

A Survey on Tenacity Parameter\\Part II

Dara Moazzami; Asieh Khoshnood

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

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

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

An Efficient Gannet Optimization Algorithm for Feature Selection based on Sensitivity and Specificity

Najme mansouri; Amir Mohammad Sharafaddini

Volume 54, Issue 2 , December 2022, , Pages 49-69

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

Abstract
  The selection of features is a crucial step in the analysis of high-dimensional data in machine learning and data mining. Gannet Optimization Algorithm (GOA) is a recently proposed metaheuristic algorithm that has not yet been investigated in terms of its capacity to solve feature selection problems. ...  Read More

On some main parameters of stochastic processes on directed graphs

Mehdi Shams; Gholamreza Hesamian

Volume 55, Issue 1 , June 2023, , Pages 53-65

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

Abstract
  A random walk is a special kind of stochastic process of the Markov chain type. Some stochastic processes can be represented as a random walk on a graph. In this paper, the main parameters for a random walk on graph are examined.  Read More

On the domination number of generalized Petersen graphs

Abolfazl Poureidi

Volume 52, Issue 2 , December 2020, , Pages 57-65

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

Abstract
  Let $n$ and $k$ be integers such that $3\leq 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 \leq n\}$, whereaddition is in modulo $n$. A subset $D\subseteq V$ is ...  Read More

On the J-Tightness of Graphs

Abolfazl Javan; Majid Javan; M. Jafarpour; Dara Moazzami; Ali Moieni

Volume 53, Issue 2 , December 2021, , Pages 57-74

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

Abstract
  We introduce a new invariant vulnerability parameter named “J-Tightness” or “J(G)” for graphs. As a stability measure, its properties along with comparisons to other parameters of a graph are proposed. We show how it is calculated for complete graphs and cycles. We show that J-Tightness ...  Read More

Signature GOA: A novel comfort zone parameter adjustment using fuzzy signature for task scheduling in cloud environment

Aboozar Zandvakili; Najme Mansouri; Mohammad Masoud Javidi

Volume 53, Issue 1 , June 2021, , Pages 61-95

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

Abstract
  Task scheduling in cloud computing plays an essential role for service provider to enhance its quality of service. Grasshopper Optimization Algorithm (GOA) is an evolutionary computation technique developed by emulating the swarming behavior of grasshoppers while searching for food. GOA is easy to implement ...  Read More

What makes a Rhythm to be Bad

Saeed Jafaripour; Zahra Nilforoushan; Keivan Borna

Volume 52, Issue 1 , June 2020, , Pages 65-82

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

Abstract
  Deciding whether a musical rhythm is good or not, depends on many factors like geographical conditions of a region, culture, the mood of society, the view of rhythm over years, and so on. In this paper, we want to make a decision from the scientific point of view, using geometric features of rhythms, ...  Read More

On Hardy's Apology Numbers

Dr. Henk Koppelaar; Peyman Nasehpour

Volume 52, Issue 2 , December 2020, , Pages 67-83

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

Abstract
  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. Combinatorial operators are defined to ease programming the search.  Read More

Pair Difference Cordial Labeling of Double Alternate Snake Graphs

R Ponraj; A Gayathri

Volume 55, Issue 1 , June 2023, , Pages 67-77

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

Abstract
  In this paper we investigate the pair difference cordial labeling behavior of double alternate triangular snake and double alternate quadrilatral snake graphs.  Read More

C. elegans Neural Network Analysis

Maliheh Ghomsheh; Ali Kamandi

Volume 54, Issue 2 , December 2022, , Pages 71-91

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

Abstract
  Artificial neural networks that have been so popular in recent years, are inspired from biological neural networks in the nature. The aim of this work is to study the properties of biological neural networks to find out what is actually happening in these networks. To do so, we study on Caenrohibditis ...  Read More

Comparison of solutions resulted from direct problems formulated as FRE

Amin Ghodousian; Sara Zal

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

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

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

Fuzzy Cumulative Distribution Function and its Properties }

Gholamreza Hesamian; Mehdi Shams

Volume 53, Issue 2 , December 2021, , Pages 75-84

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

Abstract
  The statistical methods based on cumulative distribution function is a start point for  many parametric or nonparametric statistical inferences. However, there are many practical problems that require dealing with observations/parameters that represent inherently imprecise.  However, Hesamian ...  Read More

An attributed network embedding method to predict missing links in protein-protein interaction networks

Ali Golzadeh; Ali Kamandi; Hossein Rahami

Volume 55, Issue 1 , June 2023, , Pages 79-99

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

Abstract
  Predicting missing links in noisy protein-protein interaction networks is an essential~computational method. Recently, attributed network embedding methods have been shown to be significantly effective in generating low-dimensional representations of nodes to predict links; in these representations, ...  Read More