C
  • Cordial labeling Totally magic cordial labeling of some graphs [Volume 46, Issue 1, 2015, Pages 1-8]
H
  • Harary graph Toughness of the Networks with Maximum Connectivity [Volume 46, Issue 1, 2015, Pages 51-71]
  • H-decomposable graph Mixed cycle-E-super magic decomposition of complete bipartite graphs [Volume 46, Issue 1, 2015, Pages 35-50]
  • H-E-super magic labeling Mixed cycle-E-super magic decomposition of complete bipartite graphs [Volume 46, Issue 1, 2015, Pages 35-50]
P
  • Path Further results on total mean cordial labeling of graphs [Volume 46, Issue 1, 2015, Pages 73-83]
R
  • Ramsey minimal graph All Ramsey (2K2,C4)−Minimal Graphs [Volume 46, Issue 1, 2015, Pages 9-25]
S
  • Star Further results on total mean cordial labeling of graphs [Volume 46, Issue 1, 2015, Pages 73-83]
T