Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge ...

Let $G$ be a graph. Let $f:Vleft(Gright)rightarrow left{0,1,2,ldots,k-1right}$ be a function where $kin mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $fleft(uvright)=leftlceil frac{fleft(uright)+fleft(vr ...

Let $G$ be a graph. Let $f:Vleft(Gright)rightarrow left{0,1,2,ldots,k-1right}$ be a function where $kin mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $fleft(uvright)=leftlceil frac{fleft(uright)+fleft(vright ...

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\ri ...

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\ri ...

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 $G$ if ...

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). ...

Let G be a graph. Let f : V (G) → {0, 1, 2,... ,k − 1}be a function where k ∈ N and k > 1. For each edge uv, assign thelabel f (uv) = lf(u)+f(v)2m. f is called a k-total mean cordial label ing of G if |tmf (i) − tmf (j)| ...

Improving efficiency of multi-level fast multi-pole algorithm (MLFMA) on distributed and parallel systems has been vastly studied, specially for GPUs. Unlike the far-field computation, acceleration of near-field computation ...

In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction ...

Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph ...

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 ...

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 ...

The notion of Asteroidal triples was introduced by Lekkerkerker and Boland [6]. D.G.Corneil and others [2], Ekkehard Kohler [3] further investigated asteroidal triples. Walter generalized the concept of asteroidal triples ...

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 ...

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 ...

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 ...

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors ...

In this paper a finite difference method for solving 2-dimensional diffusion equation is presented. The method employs Crank-Nicolson scheme to improve finite difference formulation and its convergence and stability. The ...

One of the important topics in oncology for treatment and prevention is the identification of genes that initiate cancer in cells. These genes are known as cancer driver genes (CDG). Identifying driver genes is important ...