مرور Volume 50, Issue 1 بر اساس عنوان
در حال نمایش موارد 1 - 11 از 11
-
Defining the Tipping Point Based on Conditionally Convergent Series: Explaining the Indeterminacy
(University of Tehran, 2018-06-01)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 ...
-
Improper Filter Reduction
(University of Tehran, 2018-06-01)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 ...
-
Improved label propagation algorithms with node attribute and link strength for community detection
(University of Tehran, 2018-06-01)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, ...
-
$k$-Total prime cordial labeling of graphs
(University of Tehran, 2018-06-01)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 ...
-
Novel Computation of Algorithmic Geometric Series and Summability
(University of Tehran, 2018-06-01)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 ...
-
One Modulo Three Geometric Mean Graphs
(University of Tehran, 2018-06-01)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 1leq a leq 3q-2} $ and either $aequiv 0(mod 3) $ or $ aequiv 1(mod 3)}$ ...
-
Pointed Conflict-Free Colouring of Digraphs
(University of Tehran, 2018-06-01)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 ...
-
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
(University of Tehran, 2018-06-01)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 ...
-
Solving a non-linear optimization problem in the presence of Yager-FRE constraints
(University of Tehran, 2018-06-01)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 ...
-
Tree Technology for Memory Confidentiality Integrity Protection
(University of Tehran, 2018-06-01)PCIPunderline{ }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 ...
-
Vertex Switching in 3-Product Cordial Graphs
(University of Tehran, 2018-06-01)A mapping $f: V(G)rightarrowleft{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, jin {0, 1, 2}$, where $v_f(i)$ denotes the number of ...



