Volume 55 (2023)
Volume 54 (2022)
Volume 53 (2021)
Volume 52 (2020)
Volume 51 (2019)
Volume 50 (2018)
Volume 48 (2016)
Volume 47 (2016)
Volume 46 (2015)
Volume 45 (2014)
Volume 44 (2013)
Volume 43 (2009)
Volume 42 (2008)
Volume 41 (2007)
A novel algorithm to determine the leaf (leaves) of a binary tree from its preorder and postorder traversals

N. Aghaieabiane; H. Koppelaar; Peyman Nasehpour

Volume 49, Issue 2 , December 2017, Pages 1-11

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

Abstract
  Binary trees are essential structures in Computer Science. The leaf (leaves) of a binary tree is one of the most significant aspects of it. In this study, we prove that the order of a leaf (leaves) of a binary tree is the same in the main tree traversals; preorder, inorder, and postorder. Then, we prove ...  Read More

Super Pair Sum Labeling of Graphs

R. Vasuki; S. Arockiaraj; P. Sugirtha

Volume 49, Issue 2 , December 2017, Pages 13-22

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

Abstract
  Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)\cup E(G)$ to $\{0, \pm 1, \pm2, \dots, \pm (\frac{p+q-1}{2})\}$ when $p+q$ is odd and from $V(G)\cup E(G)$ to $\{\pm 1, \pm 2, \dots, \pm (\frac{p+q}{2})\}$ ...  Read More

Just chromatic exellence in fuzzy graphs

M. Dharmalingam; R. Udaya Suriya

Volume 49, Issue 2 , December 2017, Pages 23-32

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

Abstract
  A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965\cite{zl} and further studied\cite{ka}. It was Rosenfeld\cite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs ...  Read More

Vulnerability Measure of a Network - a Survey

Dara Moazzami

Volume 49, Issue 2 , December 2017, Pages 33-40

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

Abstract
  In this paper we discuss about tenacity and its properties in stability calculation. We indicate relationships between tenacity and connectivity, tenacity and binding number, tenacity and toughness. We also give good lower and upper bounds for tenacity. Since we are primarily interested in the case where ...  Read More

k-Remainder Cordial Graphs

R. Ponraj; K. Annathurai; R. Kala

Volume 49, Issue 2 , December 2017, Pages 41-52

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

Abstract
  In this paper we generalize the remainder cordial labeling, called $k$-remainder cordial labeling and investigate the $4$-remainder cordial labeling behavior of certain graphs.  Read More

A new indexed approach to render the attractors of Kleinian groups

Alessandro Rosa

Volume 49, Issue 2 , December 2017, Pages 53-62

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

Abstract
  One widespread procedure to render the attractor of Kleinian groups, appearing in the renown book [8], wantshuge memory resources to compute and store the results. We present a new faster and lighter version that drops the original array and pulls out group elements from integers.  Read More

Solving a non-convex non-linear optimization problem constrained by fuzzy relational equations and Sugeno-Weber family of t-norms

Amin Ghodousian; A. Ahmadi; A. Dehghani

Volume 49, Issue 2 , December 2017, Pages 63-101

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

Abstract
  Sugeno-Weber family of t-norms and t-conorms is one of the most applied one in various fuzzy modelling problems. This family of t-norms and t-conorms was suggested by Weber for modeling intersection and union of fuzzy sets. Also, the t-conorms were suggested as addition rules by Sugeno for so-called  ...  Read More

New Algorithm For Computing Secondary Invariants of Invariant Rings of Monomial Groups

Sajjad Rahmany; Abdolali Basiri; Behzad Salehian

Volume 49, Issue 2 , December 2017, Pages 103-111

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

Abstract
  In this paper, a new  algorithm for computing secondary invariants of  invariant rings of monomial groups is presented. The main idea is to compute simultaneously a truncated SAGBI-\G basis and the standard invariants of the ideal generated by the set of primary invariants.  The advantage ...  Read More

Vibration Analysis of Global Near-regular Mechanical Systems

Iman Shojaei; Hossein Rahami

Volume 49, Issue 2 , December 2017, Pages 113-118

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

Abstract
  Some near-regular mechanical systems involve global deviations from their corresponding regular system. Despite extensive research on vibration analysis (eigensolution) of regular and local near-regular mechanical systems, the literature on vibration analysis of global near-regular mechanical systems ...  Read More

Some Properties of $(1,2)^*$-Soft\\ b-Connected Spaces

N. Revathi; K. Bageerathi

Volume 49, Issue 2 , December 2017, Pages 119-127

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

Abstract
  In this paper we introduce the concept of $(1,2)^*$-sb-separated sets and $(1,2)^*$-soft b-connected spaces and prove some properties related to these \break topics. Also we disscused the properties of $(1,2)^*$-soft b- compactness in soft bitopological space  Read More

Group $\{1, -1, i, -i\}$ Cordial Labeling of sum of $C_n$ and $K_m$ for some $m$

M.K.Karthik Chidambaram; S. Athisayanathan; R. Ponraj

Volume 49, Issue 2 , December 2017, Pages 129-139

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

Abstract
  Let G be a (p,q) graph and A be a group. We denote the order of an element $a \in A $ by $o(a).$  Let $ f:V(G)\rightarrow A$ be a function. For each edge $uv$ assign the label 1 if $(o(f(u)),o(f(v)))=1 $or $0$ otherwise. $f$ is called a group A Cordial labeling if $|v_f(a)-v_f(b)| \leq 1$ and $|e_f(0)- ...  Read More

Normalized Tenacity and Normalized Toughness of Graphs

A. Javan; M. Jafarpour; D. Moazzami; A. Moieni

Volume 49, Issue 2 , December 2017, Pages 141-159

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

Abstract
  In this paper, we introduce the novel parameters indicating Normalized Tenacity ($T_N$) and Normalized Toughness ($t_N$) by a modification on existing Tenacity and Toughness parameters.  Using these new parameters enables the graphs with different orders be comparable with each other regarding their ...  Read More