Keyword Index

A

  • A-magic labeling $Z_k$-Magic Labeling of Some Families of Graphs [Volume 50, issue 2, 2018, Pages 1-12]

B

  • Bistar $k$-Total prime cordial labeling of graphs [Volume 50, Issue 1, 2018, Pages 143-149]

C

  • Cartesian product and Strong product 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]
  • Community Detection Improved label propagation algorithms with node attribute and link strength for community detection [Volume 50, Issue 1, 2018, Pages 29-50]

D

  • Dumbbell graph $4$-Total prime cordial labeling of some cycle related graphs [Volume 50, issue 2, 2018, Pages 49-57]

E

  • Estimation Improper Filter Reduction [Volume 50, Issue 1, 2018, Pages 69-99]

F

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

H

  • Helm $4$-Total prime cordial labeling of some cycle related graphs [Volume 50, issue 2, 2018, Pages 49-57]

I

  • Interval graphs Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time [Volume 50, issue 2, 2018, Pages 81-87]
  • Inverse eigenvalue problem Inverse eigenvalue problem for matrices whose graph is a banana tree [Volume 50, issue 2, 2018, Pages 89-101]

L

  • Label Propagation Improved label propagation algorithms with node attribute and link strength for community detection [Volume 50, Issue 1, 2018, Pages 29-50]
  • Link Strength Improved label propagation algorithms with node attribute and link strength for community detection [Volume 50, Issue 1, 2018, Pages 29-50]

N

  • Node Attribute Improved label propagation algorithms with node attribute and link strength for community detection [Volume 50, Issue 1, 2018, Pages 29-50]

P

  • Path $k$-Total prime cordial labeling of graphs [Volume 50, Issue 1, 2018, Pages 143-149]
  • Prism $4$-Total prime cordial labeling of some cycle related graphs [Volume 50, issue 2, 2018, Pages 49-57]

S

  • Scheduling Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time [Volume 50, issue 2, 2018, Pages 103-119]
  • Sign test Sign Test for Fuzzy Random Variables [Volume 50, issue 2, 2018, Pages 121-139]
  • Single machine Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time [Volume 50, issue 2, 2018, Pages 103-119]
  • Star $k$-Total prime cordial labeling of graphs [Volume 50, Issue 1, 2018, Pages 143-149]
  • Sun flower graph $4$-Total prime cordial labeling of some cycle related graphs [Volume 50, issue 2, 2018, Pages 49-57]

T

  • Tardy job Minimizing the Number of Tardy Jobs on Single Machine Scheduling with Flexible Maintenance Time [Volume 50, issue 2, 2018, Pages 103-119]
  • Tenacity Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time [Volume 50, issue 2, 2018, Pages 81-87]
  • Topological indices 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]

V

  • Vertex degree 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]
  • Vulnerability parameters Tenacity and some other Parameters of Interval Graphs can be computed in polynomial time [Volume 50, issue 2, 2018, Pages 81-87]