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)
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

R. Muruganandam; R.S. Manikandan; M.Aruvi Aruvi

Volume 50, Issue 1 , June 2018, Pages 1-28


  In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. ...  Read More

Improved label propagation algorithms with node attribute and link strength for community detection

Mohsen Arab; Mahdieh Hasheminezhad

Volume 50, Issue 1 , June 2018, Pages 29-50


  Community detection has a wide variety of  applications in different fields such as data mining, social network analysis and so on. Label Propagation Algorithm (LPA) is a simple and fast community detection algorithm, but it has low accuracy. There have been presented   some advanced versions ...  Read More

Tree Technology for Memory Confidentiality Integrity Protection

Hui Min Meng; HongJin Wang; NianMin Yao; ShunYi Cheng

Volume 50, Issue 1 , June 2018, Pages 51-67


  PCIP\underline{ }Tree is a Parallelized memory Confidentiality and Integrity Protection technology (PCIP) method that pre-diffuses and encrypts the data stored in off-chip counter value for confidentiality and integrity protection of data, adding redundant checking data to the protection data block to ...  Read More

Improper Filter Reduction

Fatemehzahra Saberifar; Ali Mohades; Mohammadreza Razzazi; Jason J. M. O'Kane

Volume 50, Issue 1 , June 2018, Pages 69-99


  Combinatorial filters, which are discrete representations of estimationprocesses, have been the subject of increasing interest from the roboticscommunity in recent years.%This paper considers automatic reduction of combinatorial filters to a givensize, even if that reduction necessitates changes to the ...  Read More

One Modulo Three Geometric Mean Graphs

P. Jeyanthi; A. Maheswari; P. Pandiaraj

Volume 50, Issue 1 , June 2018, Pages 101-108


  A graph $G$ is said to be one modulo three geometric mean graph if there is an injective function $\phi$ from the vertex set of $G$ to the set $\{a \mid 1\leq a \leq 3q-2\} $ and either $a\equiv 0(mod 3) $ or $ a\equiv 1(mod 3)\}$ where $q$ is the number of edges of $G$ and $\phi$ induces a bijection ...  Read More

Vulnerability in Networks - A Survey

Dara Moazzami

Volume 50, Issue 1 , June 2018, Pages 109-118


  The analysis of vulnerability in networks generally involves some questionsabout how the underlying graph is connected. One is naturally interestedin studying the types of disruption in the network that maybe causedby failures of certain links or nodes. In terms of a graph, the concept ofconnectedness ...  Read More

Pointed Conflict-Free Colouring of Digraphs

Mahdieh Hasheminezhad

Volume 50, Issue 1 , June 2018, Pages 119-131


  In a pointed conflict-free partial   (PCFP) colouring of a digraph, each vertex has at least  one in-neighbour with unique colour.  In this paper,  it is proved that PCFP $k$-colourability of digraphs is NP-complete,  for any $k >0$.  Nevertheless  for   ...  Read More

Defining the Tipping Point Based on Conditionally Convergent Series: Explaining the Indeterminacy

Mohammad Hosseini Moghaddam; Tahmineh Sahverdi

Volume 50, Issue 1 , June 2018, Pages 133-142


  Tipping Point refers to the moment when an adaption or infection sustains itself in network without further external inputs. Until now, studies have mainly focused on the occurrence of the Tipping Point and what it leads to rather than what precedes it. This paper explores the situation leading to the ...  Read More

$k$-Total prime cordial labeling of graphs

R Ponraj; J Maruthamani; R Kala

Volume 50, Issue 1 , June 2018, Pages 143-149


  In this paper we introduce a new graph labeling method called $k$-Total prime cordial. 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 ...  Read More

Novel Computation of Algorithmic Geometric Series and Summability

Chinnaraji Annamalai

Volume 50, Issue 1 , June 2018, Pages 151-153


  This paper presents a new mathematical technique for computation of geometric series and summability. This technique uses Annamalai’s computing model of algorithmic geometric series and its mathematical structures for further development of the infinite geometric series and summability. This could ...  Read More

Solving a non-linear optimization problem in the presence of Yager-FRE constraints

A. Ghodousian; Abolfazl Javan; Asieh Khoshnood

Volume 50, Issue 1 , June 2018, Pages 155-183


  Yager family of t-norms is a parametric family of continuous nilpotent t-norms which is also one of the most frequently applied one. This family of t-norms is strictly increasing in its parameter and covers the whole spectrum of t-norms when the parameter is changed from zero to infinity. In this paper, ...  Read More

Vertex Switching in 3-Product Cordial Graphs

P. Jeyanthi; A. Maheswari; M. VijayaLakshmi

Volume 50, Issue 1 , June 2018, Pages 185-188


  A mapping  $f: V(G)\rightarrow\left\{0, 1, 2 \right\}$ is called 3-product cordial labeling if $\vert v_f(i)-v_f(j)\vert \leq 1$ and $\vert e_f(i)-e_f(j)\vert \leq 1$ for any $ i, j\in \{0, 1, 2\}$, where $v_f(i)$ denotes the number of vertices labeled  with $i, e_f (i)$ denotes the number ...  Read More