Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Issue 2 December 2021, Pages 1-208
Issue 1 June 2021, Pages 1-208
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)
Fr\'echet-Like Distances between Two Rooted Trees

Elena Farahbakhsh Touli

Volume 53, Issue 1 , June 2021, Pages 1-12


  The purpose of this paper is to extend the definition of Fr\'echet distance which measures the distance between two curves to a distance (Fr\'echet-Like distance) which measures the similarity between two rooted trees.In this paper, I prove that the Fr\'echet-Like distance between two trees is SNP-hard ...  Read More

$4$-total mean cordial labeling of special graphs

R Ponraj; S SUBBULAKSHMI; S Somasundaram

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


  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 New Numerical Solution for System of Linear Equations

Iman Shojaei; Hossein Rahami

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


  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

$\alpha$-Gap Greedy Spanner

Hosein Salami; Mostafa Nouri Baygi

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


  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

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


  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

A Numerical Method for Eigensolution of Tridiagonal Matrices

Iman Shojaei; Hossein Rahami

Volume 53, Issue 1 , June 2021, Pages 97-115


  In this paper we have developed an iterative method to solve eigenproblem for non-repetitive tridiagonal matrices. The importance of eigensolution for tridiagonal matrices is that in many algorithms the eigneproblem for an arbitrary matrix is first converted to the eigenproblem for a tridiagonal matrix ...  Read More

An Alternative Proof for a Theorem of R.L. Graham Concerning CHEBYSHEV Polynomials

A.M.S.. Ramasamy; R Ponraj

Volume 53, Issue 1 , June 2021, Pages 117-122


  In this paper, an alternative proof is provided for a theorem of R.L.Graham concerning Chebyshev polynomials.  While studying the properties of a double star, R.L.Graham [2] proved a theorem concerning Chebyshev polynomials of the first kind ${T_n (x)}$. The purpose of this paper is to provide an ...  Read More

On the Minimum of True Matches in Exact Graph Matching with Simulated Annealing

Hashem Ezzati; Mahmood Amintoosi; Hashem Tabasi

Volume 53, Issue 1 , June 2021, Pages 123-134


  Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains. Although meta-heuristic algorithms have had good performance on many NP-Hard and NP-Complete problems, but for graph matching problem, there were not reported ...  Read More

A fast algorithm for the linear programming problem constrained with the Weighted power mean -- Fuzzy Relational Equalities (WPM-FRE)

Amin Ghodousian; Sara Zal

Volume 53, Issue 1 , June 2021, Pages 135-148


  In this paper, a linear programming problem is investigated in which the feasible region is formed as a special type of fuzzy relational equalities (FRE). In this type of FRE, fuzzy composition is considered as the weighted power mean operator (WPM). Some theoretical properties of the feasible region ...  Read More

Pair Difference Cordiality of Some Snake and Butterfly Graphs

R Ponraj; A Gayathri; S Somasundaram

Volume 53, Issue 1 , June 2021, Pages 149-163


  \noindent 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 ...  Read More

Use of Digital Image Watermarking to Enhance the Security of Graphical Password Authentication

Saeid Sadeghi; Kooroush Manochehri; mohsen jahanshahi

Volume 53, Issue 1 , June 2021, Pages 165-180


  There are several techniques for implement an authentication system for computers that most commonly use the clear text password. One of the security problems is the use of a text password, the lack of choosing a complicated password by users due to forgetting, and being guessable and retrieved by attackers. ...  Read More

A Survey on Tenacity Parameter\\Part I

Asieh Khoshnood; Dara Moazzami

Volume 53, Issue 1 , June 2021, Pages 181-196


  If we think of the graph as modeling a network, the vulnerability measurethe resistance of the network to disruption of operation after the failure of certainstations or communication links. In assessing the "vulnerability"of a graph one determines the extent to which the graph retains certainproperties ...  Read More

BloomEclat: Efficient Eclat Algorithm based on Bloom filter

sina abbasi; Ali Moieni

Volume 53, Issue 1 , June 2021, Pages 197-208


  Eclat is an algorithm that finds frequent itemsets. It uses a vertical database and calculates item's support by intersecting transactions. However, Eclat suffers from the exponential time complexity of calculating the intersection of transactions. In this paper, a randomized algorithm called BloomEclat ...  Read More