Volume 55 (2023)
Issue 1 June 2023, Pages 1-189
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 spider graph

R Ponraj; S SUBBULAKSHMI; Prof.Dr M.Sivakumar

Volume 55, Issue 1 , June 2023, Pages 1-9


  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 a $k$-total mean cordial ...  Read More

Perfectionism Search Algorithm (PSA): An Efficient Meta-Heuristic Optimization Approach

Amin Ghodousian; Mahdi Mollakazemiha; Noushin Karimian

Volume 55, Issue 1 , June 2023, Pages 11-36


  This paper proposes a novel population-based meta-heuristic optimization algorithm, called Perfectionism SearchAlgorithm (PSA), which is based on the psychological aspects of perfectionism. The PSA algorithm takes inspiration from one of the most popular model of perfectionism, which was proposed by ...  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


  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

On some main parameters of stochastic processes on directed graphs

Mehdi Shams; Gholamreza Hesamian

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


  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

Pair Difference Cordial Labeling of Double Alternate Snake Graphs

R Ponraj; A Gayathri

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


  In this paper we investigate the pair difference cordial labeling behavior of double alternate triangular snake and double alternate quadrilatral snake graphs.  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


  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

Hybrid Filter-Wrapper Feature Selection using Equilibrium Optimization

Mohammad Ansari Shiri; Najme Mansouri

Volume 55, Issue 1 , June 2023, Pages 101-122


  The topic of feature selection has become one of the hottest subjects in machine learning over the last few years. The results of evolutionary algorithm selection have also been promising, along with standard feature selection algorithms. For K-Nearest Neighbor (KNN) classification, this paper presents ...  Read More

A Note on Change Point Analysis Using Filtering

Reza Habibi

Volume 55, Issue 1 , June 2023, Pages 123-129


  The Kalman-Bucy filter is studied under different scenarios for observation and state equations, however, an important question is, how this filter may be applied to detect the change points. In this paper, using the Bayesian approach, a modified version of this filter is studied which has good and justifiable ...  Read More

Sequence pairs related to produced graphs from a method for dividing a natural number by two.

Mohammad Zeynali Azim; Saeid Alikhani; Babak Anari; Bagher Zarei

Volume 55, Issue 1 , June 2023, Pages 131-140


  This paper is about producing a new kind of pairs which we call MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present some applications of these pairs that show their interesting properties ...  Read More

Using a New Strategy in Imperialist Competitive Algorithm to Solve Multi‑objective Problems (WSICA)

Mina Moosapour; Ahmad Bagheri; Mohammad Javad Mahmoodabadi

Volume 55, Issue 1 , June 2023, Pages 141-183


  The imperialist competitive algorithm (ICA) is developed based on the socio-political process of imperialist competitions. It is an efficient approach for single-objective optimization problems. However, this algorithm fails to optimize multi-objective problems (MPOs) with conflicting objectives. This ...  Read More