Author Index

A

  • Annamalai, Chinnaraji Novel Computation of Algorithmic Geometric Series and Summability [Volume 50, Issue 1, 2018, Pages 151-153]
  • Arab, Mohsen Improved label propagation algorithms with node attribute and link strength for community detection [Volume 50, Issue 1, 2018, Pages 29-50]
  • Aruvi, M.Aruvi Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs [Volume 50, Issue 1, 2018, Pages 1-28]

B

  • Babaei Zarch, Maryam Inverse eigenvalue problem for matrices whose graph is a banana tree [Volume 50, issue 2, 2018, Pages 89-101]
  • Barrientos, Christian Snakes and Caterpillars in Graceful Graphs [Volume 50, issue 2, 2018, Pages 37-47]

C

  • Cheng, ShunYi Tree Technology for Memory Confidentiality Integrity Protection [Volume 50, Issue 1, 2018, Pages 51-67]

G

  • Ganji, Fatemeh Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time [Volume 50, issue 2, 2018, Pages 103-119]
  • Ghodousian, A. Solving a non-linear optimization problem in the presence of Yager-FRE constraints [Volume 50, Issue 1, 2018, Pages 155-183]
  • Ghodousian, A. LP problems constrained with D-FRIs [Volume 50, issue 2, 2018, Pages 59-79]
  • Ghodousian, Amin Linear programming on SS-fuzzy inequality constrained problems [Volume 50, issue 2, 2018, Pages 13-36]

H

  • Hasheminezhad, Mahdieh Improved label propagation algorithms with node attribute and link strength for community detection [Volume 50, Issue 1, 2018, Pages 29-50]
  • Hasheminezhad, Mahdieh Pointed Conflict-Free Colouring of Digraphs [Volume 50, Issue 1, 2018, Pages 119-131]
  • Hesamian, Gholamreza Sign Test for Fuzzy Random Variables [Volume 50, issue 2, 2018, Pages 121-139]
  • Hosseini Moghaddam, Mohammad Defining the Tipping Point Based on Conditionally Convergent Series: Explaining the Indeterminacy [Volume 50, Issue 1, 2018, Pages 133-142]

J

  • Jafarpour, M. LP problems constrained with D-FRIs [Volume 50, issue 2, 2018, Pages 59-79]
  • Jamali, Amir Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time [Volume 50, issue 2, 2018, Pages 103-119]
  • Javan, Abolfazl Solving a non-linear optimization problem in the presence of Yager-FRE constraints [Volume 50, Issue 1, 2018, Pages 155-183]
  • Jeyadaisy, K. $Z_k$-Magic Labeling of Some Families of Graphs [Volume 50, issue 2, 2018, Pages 1-12]
  • Jeyanthi, P. One Modulo Three Geometric Mean Graphs [Volume 50, Issue 1, 2018, Pages 101-108]
  • Jeyanthi, P. Vertex Switching in 3-Product Cordial Graphs [Volume 50, Issue 1, 2018, Pages 185-188]
  • Jeyanthi, P. $Z_k$-Magic Labeling of Some Families of Graphs [Volume 50, issue 2, 2018, Pages 1-12]
  • J. M. O'Kane, Jason Improper Filter Reduction [Volume 50, Issue 1, 2018, Pages 69-99]

K

  • Kala, R $k$-Total prime cordial labeling of graphs [Volume 50, Issue 1, 2018, Pages 143-149]
  • Karbassi, Seyed Mehdi Inverse eigenvalue problem for matrices whose graph is a banana tree [Volume 50, issue 2, 2018, Pages 89-101]
  • Khoshnood, Asieh Solving a non-linear optimization problem in the presence of Yager-FRE constraints [Volume 50, Issue 1, 2018, Pages 155-183]

M

  • Maheswari, A. One Modulo Three Geometric Mean Graphs [Volume 50, Issue 1, 2018, Pages 101-108]
  • Maheswari, A. Vertex Switching in 3-Product Cordial Graphs [Volume 50, Issue 1, 2018, Pages 185-188]
  • Manikandan, R.S. Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs [Volume 50, Issue 1, 2018, Pages 1-28]
  • Maruthamani, J $k$-Total prime cordial labeling of graphs [Volume 50, Issue 1, 2018, Pages 143-149]
  • Maruthamani, J $4$-Total prime cordial labeling of some cycle related graphs [Volume 50, issue 2, 2018, Pages 49-57]
  • Mehrabadi, Somayeh Changes in Artificial Neural Network Learning Parameters and Their Impact on Modeling Error Reduction [Volume 50, issue 2, 2018, Pages 141-155]
  • Meng, Hui Min Tree Technology for Memory Confidentiality Integrity Protection [Volume 50, Issue 1, 2018, Pages 51-67]
  • Minion, Sarah M Snakes and Caterpillars in Graceful Graphs [Volume 50, issue 2, 2018, Pages 37-47]
  • Moazzami, Dara Vulnerability in Networks - A Survey [Volume 50, Issue 1, 2018, Pages 109-118]
  • Moazzami, Dara Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time [Volume 50, issue 2, 2018, Pages 81-87]
  • Mohades, Ali Improper Filter Reduction [Volume 50, Issue 1, 2018, Pages 69-99]
  • Muruganandam, R. Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs [Volume 50, Issue 1, 2018, Pages 1-28]

P

  • Pandiaraj, P. One Modulo Three Geometric Mean Graphs [Volume 50, Issue 1, 2018, Pages 101-108]
  • Ponraj, R $k$-Total prime cordial labeling of graphs [Volume 50, Issue 1, 2018, Pages 143-149]
  • Ponraj, R $4$-Total prime cordial labeling of some cycle related graphs [Volume 50, issue 2, 2018, Pages 49-57]

R

S

  • Saberifar, Fatemehzahra Improper Filter Reduction [Volume 50, Issue 1, 2018, Pages 69-99]
  • Sahverdi, Tahmineh Defining the Tipping Point Based on Conditionally Convergent Series: Explaining the Indeterminacy [Volume 50, Issue 1, 2018, Pages 133-142]
  • Shahzadeh Fazeli, Seyed Abolfazl Inverse eigenvalue problem for matrices whose graph is a banana tree [Volume 50, issue 2, 2018, Pages 89-101]
  • Shams, Mehdi Sign Test for Fuzzy Random Variables [Volume 50, issue 2, 2018, Pages 121-139]

V

  • Vahdat, Niloofar Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time [Volume 50, issue 2, 2018, Pages 81-87]
  • VijayaLakshmi, M. Vertex Switching in 3-Product Cordial Graphs [Volume 50, Issue 1, 2018, Pages 185-188]

W

  • Wang, HongJin Tree Technology for Memory Confidentiality Integrity Protection [Volume 50, Issue 1, 2018, Pages 51-67]

Y

  • Yao, NianMin Tree Technology for Memory Confidentiality Integrity Protection [Volume 50, Issue 1, 2018, Pages 51-67]