C
-
Cellular Automata
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering [Volume 47, Issue 1, 2016, Pages 93-99]
H
-
H-decomposable graph
Mixed cycle-E-super magic decomposition of complete bipartite graphs [Volume 47, Issue 1, 2016, Pages 37-52]
-
H-E-super magic labeling
Mixed cycle-E-super magic decomposition of complete bipartite graphs [Volume 47, Issue 1, 2016, Pages 37-52]
I
-
Integrity parameter
A Survey on Complexity of Integrity Parameter [Volume 47, Issue 1, 2016, Pages 11-19]
L
-
Local Algorithm
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering [Volume 47, Issue 1, 2016, Pages 93-99]
M
-
Markov chain
Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model [Volume 47, Issue 1, 2016, Pages 79-92]
-
Mobile Sensor Gathering
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering [Volume 47, Issue 1, 2016, Pages 93-99]
-
Mobile Wireless Sensor Network
A Cellular Automaton Based Algorithm for Mobile Sensor Gathering [Volume 47, Issue 1, 2016, Pages 93-99]
N
-
NP-complete problem
Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model [Volume 47, Issue 1, 2016, Pages 79-92]
P
-
Path
3-difference cordial labeling of some cycle related graphs [Volume 47, Issue 1, 2016, Pages 1-10]
S
-
SAT problem
Randomized Algorithm For 3-Set Splitting Problem and it's Markovian Model [Volume 47, Issue 1, 2016, Pages 79-92]
-
Star
3-difference cordial labeling of some cycle related graphs [Volume 47, Issue 1, 2016, Pages 1-10]
U
-
Upper bound
Online Scheduling of Jobs for D-benevolent instances On Identical Machines [Volume 47, Issue 1, 2016, Pages 27-36]
V
-
Vertex degree
The edge tenacity of a split graph [Volume 47, Issue 1, 2016, Pages 119-125]
W
-
Wheel
3-difference cordial labeling of some cycle related graphs [Volume 47, Issue 1, 2016, Pages 1-10]
Z
-
Zarankiewicz number
Zarankiewicz Numbers and Bipartite Ramsey Numbers [Volume 47, Issue 1, 2016, Pages 63-78]
