Showing 261 - 280 results of 339 for search 'Sayyid~', query time: 5.15s Refine Results
  1. 261
  2. 262
    “…. © 2020, Soheil Kazemian, Hadrian Geri Djajadikerta, Saiydi Mat Roni, Terri Trireksani and Zuraidah Mohd…”
    Get full text
    Article
  3. 263
    “…Does animation play a role in multimedia learning? Animation in multimedia is said to be beneficial…”
    Get full text
    Conference paper
  4. 264
  5. 265
    “…For integers k 1, a (p, q)-graph G = (V, E) is said to admit an AL(k)-traversal if there exists a…”
    Get full text
    Article
  6. 266
    “…An edge labeling of a graph G = (V, E) is said to be local antimagic if it is a bijection f : E…”
    Get full text
    Article; Early Access
  7. 267
    “… films: Batas (Rudi Soedjarwo, 2011) from Indonesia and Bunohan: Return to Murder (Dain Said, 2012) from…”
    Get full text
    Article; Early Access
  8. 268
    “… is crucial in this application due to no bandwidth proven best. However, the amount of antenna is said…”
    Get full text
    Conference paper
  9. 269
    “…An edge labeling of a graph G = (V, E) is said to be local antimagic if it is a bijection f: E →{1…”
    Get full text
    Article
  10. 270
  11. 271
    “… films: Batas (Rudi Soedjarwo, 2011) from Indonesia and Bunohan: Return to Murder (Dain Said, 2012) from…”
    Get full text
    Article
  12. 272
    “…An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection…”
    Get full text
    Article
  13. 273
    “… but the effect can be said unsatisfactorily. One of the reasons is that the job of public servants is less…”
    Get full text
    Article
  14. 274
    “… is said to be edge-friendly if |ef(1) − ef(0)| ≤ 1. The set {vf(1) − vf(0): f is an edge-friendly labeling…”
    Get full text
    Article
  15. 275
  16. 276
    “… for the said purpose. Chitosan is a polyelectrolyte with reactive functional groups, gel-forming capability…”
    Get full text
    Book chapter
  17. 277
    “…An edge labeling of a connected graph G= (V, E) is said to be local antimagic if it is a bijection…”
    Get full text
    Article
  18. 278
  19. 279
    “…An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection…”
    Get full text
    Article
  20. 280
Search Tools: RSS Feed Email Search