دوره و شماره: دوره 50، شماره 1، تابستان 2018  XML

1

Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs

صفحه 1-28
R. Muruganandam؛ R.S. Manikandan؛ M.Aruvi Aruvi

2

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

صفحه 29-50
Mohsen Arab؛ Mahdieh Hasheminezhad

3

Tree Technology for Memory Confidentiality Integrity Protection

صفحه 51-67
Hui Min Meng؛ HongJin Wang؛ NianMin Yao؛ ShunYi Cheng

4

Improper Filter Reduction

صفحه 69-99
Fatemehzahra Saberifar؛ Ali Mohades؛ Mohammadreza Razzazi؛ Jason J. M. O'Kane

5

One Modulo Three Geometric Mean Graphs

صفحه 101-108
P. Jeyanthi؛ A. Maheswari؛ P. Pandiaraj

6

Vulnerability in Networks - A Survey

صفحه 109-118
Dara Moazzami

7

Pointed Conflict-Free Colouring of Digraphs

صفحه 119-131
Mahdieh Hasheminezhad

8

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

صفحه 133-142
Mohammad Hosseini Moghaddam؛ Tahmineh Sahverdi

9

$k$-Total prime cordial labeling of graphs

صفحه 143-149
R Ponraj؛ J Maruthamani؛ R Kala

10

Novel Computation of Algorithmic Geometric Series and Summability

صفحه 151-153
Chinnaraji Annamalai

11

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

صفحه 155-183
A. Ghodousian؛ Abolfazl Javan؛ Asieh Khoshnood

12

Vertex Switching in 3-Product Cordial Graphs

صفحه 185-188
P. Jeyanthi؛ A. Maheswari؛ M. VijayaLakshmi


Contact Us | Help & Support | Site Map

Journal Management System. Designed by sinaweb.