Publications


The following our publications in Optimal Directed Networks, Ramsey Theory, Graph Labeling, Hamiltonian Graphs,  and Metric, Partition Dimensions of Graphs.
   
In Press

  1. M. Hussain, E.T. Baskoro, On super antimagic total labeling of Harary graph, to appear in Ars Combin.
  2. Nurdin, E.T. Baskoro, A.N.M. Salman, N.N. Gaos, On total vertex-irregular labellings for several types of trees, to appear in Utilitas Math.
  3. A.A.G. Ngurah, E.T. Baskoro, I. Tomescu, Magic graphs with pendant edges, to appear in Ars Combin
  4. I W. Sudarsana, H. Assiyatun, S. Uttunggadewa, E.T. Baskoro, On the Ramsey numbers R(S2,m, K2,q) and R(sK2, Ks+Cn), to appear in Ars Combin.
  5. L. Yulianti, H. Assiyatun, S. Uttunggadewa, E.T. Baskoro, On Ramsey (K1,2, P4)-minimal Graphs, Far East Journal of Mathematical Sciences (FJMS), to appear 2010.
  6. T. Vetrik, L. Yulianti, E.T. Baskoro, On Ramsey (K1,2, C4)-minimal Graphs, Discussiones Mathematicae Graph Theory, to appear.
  7. A. Ahmad, A.Q. Baig, E.T. Baskoro, R. Simanjuntak, On the super edge-magic deficiency of forests, Util Math., to appear.
  8. A.Q. Baig, E.T. Baskoro, A. Semanicova-fenovcikova, On the super edge-magic deficiency of a star forest, Ars Combin., to appear. 
  9. A. Ahmad, K. Ali, E.T. Baskoro, On super edge-magic total labelling of a forest of banana trees, accepted for publication in  Ars Combin. 

International Publications 

  1. I Wayan Sudarsana, E.T. Baskoro, H. Assiyatun, S. Uttunggadewa, The Ramsey numbers for the union graph with H-good components, Far East Journal on Mathematical Sciences 39:1 (2010), 29-40.
  2. K. Ali, E.T. Baskoro, I. Tomescu, On the Ramsey number for paths and beaded wheels, Journal of Prime Research in Mathematics 5 (2009), 133-138.
  3. K. Ali, A.Q. Baiq, E.T. Baskoro, On the Ramsey number for a linear forest versus a cocktail party graph, J. Combin. Math. Combin. Comput. 71 (2009), 173-177.
  4. Nurdin, A.N.M. Salman, N.N. Gaos, E.T. Baskoro, On the total vertex-irregular strength of a disjoint union of t copies of a path, J. Combin. Math. Combin. Comput. 71 (2009), 227- 233.
  5. I Wayan Sudarsana, E.T. Baskoro, H. Assiyatun, S. Uttunggadewa, The Ramsey number of a certain forest respect to a small wheel, J. Combin. Math. Combin. Comput. 71 (2009), 257 - 264.
  6. Darmaji, S. Uttunggadewa, R. Simanjuntak, E.T. Baskoro, The partition dimension of a complete multipartite graph, a special caterpillar and a windmill, J. Combin. Math. Combin. Comput. 71 (2009), 209-215.
  7. Adiwijaya, A.N.M. Salman, D. Suprijanto, E.T. Baskoro, On f-colorings of the corona product of cycles with some other graphs, J. Combin. Math. Combin. Comput. 71 (2009), 235-241.
  8. Syafrizal Sy, E.T. Baskoro, S. Uttunggadewa, H. Assiyatun, Path-path size multipartite Ramsey numbers, J. Combin. Math. Combin. Comput. 71 (2009), 265-271.
  9. S.W. Saputro, E.T. Baskoro, A.N.M. Salman, D. Suprijanto, The metric dimensions of a complete n-partite graph and its cartesian product with a path, J. Combin. Math. Combin. Comput. 71 (20f09), 283 - 293.
  10. I Wayan Sudarsana, E.T. Baskoro, S. Uttunggadewa, D. Ismaimuza, Expansion techniques on the super edge antimagic total graphs, J. Combin. Math. Combin. Comput. 71 (2009), 189-199.
  11. M. Hussain, E.T. Baskoro, Slamin, On super edge-magic total labeling of banana trees, Utilitas Math. 79 (2009) 243-251.
  12. Hasmawati, E.T. Baskoro, H. Assiyatun, M. Salman A. N., Complete bipartite Ramsey numbers, Utilitas Math. 78 (2009), 129-138.
  13. I W. Sudarsana, E.T. Baskoro, S. Uttunggadewa, D. Ismaimuza, An expansion technique on super edge magic total graphs, Ars Combin. 91 (2009), 231-241.
  14. Hasmawati, H. Assiyatun, E. T. Baskoro, A.N.M. Salman , Ramsey numbers on a union of identical stars versus a small cycle, Computational Geometry and Graph Theory, LNCS 4535 (2008) 85-89.
  15. A.A. G. Ngurah, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa , On super edge-magic strength and deficiency of graphs, Computational Geometry and Graph Theory, LNCS 4535 (2008) 144-154.
  16. Hasmawati, E.T. Baskoro, H. Assiyatun, The Ramsey numbers for disjoint unions of graphs, Discrete Math. 308:10 (2008) 2046-2049.
  17. E.T. Baskoro, Y.M. Cholily, M. Miller, Enumeration of vertex orders of almost Moore digraphs with selfrepeats, Discrete Math. 308 (2008) 123-128.
  18. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the super edge-magic deficiencies of graphs, Australas. J. Combin. 40 (2008), 3-14.
  19. Surahmat, E.T. Baskoro, I. Tomescu, The Ramsey numbers of large cycles versus odd wheels, Graphs Combin. 24 (2008), 53-58.   
  20. A.A.G. Ngurah, R. Simanjuntak, E.T. Baskoro, On (super) edge-magic total labeling of subdivision of K1,3, SUT Journal of Mathematics, 43: 2 (2008), 127-136. 
  21. E.T. Baskoro, Lyra Yulianti, H. Assiyatun, Ramsey (K1,2, C4)-minimal, J. Combin. Math. Combin. Comput. 65 (2008), 79-90.
  22. Kashif Ali, E.T. Baskoro, I. Tomescu, On the Ramsey numbers for paths and generalized Jahangir graphs J(s,m), Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 51: 3 (2008) 177-182. 
  23. Kashif Ali, E.T. Baskoro, On the Ramsey numbers for a combination of paths and Jahangirs, J. Combin. Math. Combin. Comput. 65 (2008), 113-120.
  24. C. Imron, B. Setiyono, R. Simanjuntak, E.T. Baskoro, Critical set of caterpillar graph for secret sharing scheme, J. Combin. Math. Combin. Comput. 65 (2008), 121-126.
  25. H. Iswadi, E.T. Baskoro, R. Simanjuntak, A.N.M. Salman, The metric dimension of graph with pendant edges, J. Combin. Math. Combin. Comput. 65 (2008), 139-146.
  26. Surahmat, E.T. Baskoro, H.J. Broersma, The Ramsey number of large star-like trees versus odd wheels, J. Combin. Math. Combin. Comput. 65 (2008), 153-162.
  27. T. K. Maryati, E.T. Baskoro, A.N.M. Salman, Ph-sypermagic labelings of some trees,  J. Combin. Math. Combin. Comput. 65 (2008), 197-204.
  28. Nurdin, A.N.M. Salman, E.T. Baskoro, the total edge-irregular strengths of the corona product of paths with some graphs, J. Combin. Math. Combin. Comput. 65 (2008), 163-176.
  29. Syafrizal Sy, E.T. Baskoro, S. Uttunggadewa, The size multipartite Ramsey numbers for small paths versus other graphs, Far East J. Appl. Math. 28: 1 (2007), 131-138.
  30. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the new families of (super) edge-magic graphs, Utilitas Math. 74 (2007), 111-120.
  31. E.T. Baskoro, Y.M. Cholily, M. Miller, Structure of repeat cycles in almost Moore digraphs with selfrepeats and diameter 3,  Bull. Inst. Combin. Appl. 46 (2006), 99—109.
  32. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the (a,d)-antimagic total labelling of $mC_n$, Bull. Inst. Combin. Appl.  48 (2006) 35-44.
  33. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa, On edge-magic total labeling of kC4-snakes, Congressus Numerantium , 179 (2006), 97-107.
  34. E.T. Baskoro, Hasmawati, H. Assiyatun, The Ramsey numbers for disjoint unions of trees, Discrete Math. 306 (2006) 3297-3301.
  35. Surahmat, E.T. Baskoro, I. Tomescu, The Ramsey numbers of large cycles versus wheels, Discrete Math. 306 (2006) 3334-3337.
  36. E.T. Baskoro, Subanji, Methods of constructing a knight’s tour on rectangular and diamond boards, Math Track 2 (2006) 47-55.
  37. E.T. Baskoro, Y. Nuraeni, A.A.G. Ngurah, Upper bounds for the size Ramsey numbers for $P_3$ versus $C_3^t$ or $P_n$, Journal of Prime Research in Mathematics 2 (2006) 141-146.
  38. M. Baca, E.T. Baskoro, R. Simanjuntak, K.A. Sugeng, Super edge-antimagic labelings of the generalized Petersen graph P(n,(n-1)/2), Utilitas Math. 70 (2006), 119-127.
  39. Y.M. Cholily , E.T. Baskoro,  S. Uttunggadewa, Some conditions of the existence of (d,k)-digraphs, LNCS 3330 (2005) 87- 93.
  40. Surahmat, E.T. Baskoro,  S. Uttunggadewa and H. Broersma, An upper bound for the Ramsey number of cycle of length four versus wheels, LNCS 3330 (2005) 181-184.  
  41. M. Baca , E.T. Baskoro,  M. Miller, Antimagic valuations for the special class of plane graphs, LNCS 3330 (2005) 55- 61.
  42. E.T. Baskoro, M. Miller, J. Siran and M. Sutton, Complete characterisation of almost Moore digraphs of degree three, Journal of Graph Theory, 48:2 (2005), 112-126.
  43. Surahmat, E.T. Baskoro, H.J. Broersma, The Ramsey numbers of fans versus K_4, Bull. Inst. Combin. Appl.  43 (2005) 96-102.
  44. E.T. Baskoro, Surahmat, The Ramsey number of paths with respect to wheels, Discrete Math. 294 (2005) 275-277.
  45. I W. Sudarsana, D. Ismaimuza, E.T. Baskoro, H. Assiyatun, On super (a,d) -edge antimagic total labeling of  disconnected graphs, J. Combin. Math. Combin. Comput. 55 (2005), 149-158.  
  46. Hasmawati, E.T. Baskoro, H. Assiyatun, Star-wheel Ramsey  numbers, J. Combin. Math. Combin. Comput. 55 (2005), 123--128.
  47. Syafrizal Sy., E.T. Baskoro, S. Uttunggadewa, The size multipartite Ramsey numbers for paths. J. Combin. Math. Combin. Comput. 55 (2005), 103-107.
  48. I W. Sudarsana, E.T. Baskoro, D. Ismaimuza, H. Assiyatun, Creating new super edge-magic total labelings from old ones, J. Combin. Math. Combin. Comput. 55 (2005), 83-90.
  49. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On antimagic total labelings of generalized Petersen graph. J. Combin. Math. Combin. Comput. 55 (2005), 57-70.
  50. E.T. Baskoro, Critical sets in edge-magic total labelings, J. Combin. Math. Combin. Comput. 55 (2005), 33-42.
  51. M. Baca, E.T. Baskoro, Yus M. Cholily, Face antimagic labelings for a special class of plane graphs $C\sb a\sp b$, J. Combin. Math. Combin. Comput. 55 (2005), 5-15.
  52. Surahmat, E.T. Baskoro, H.J. Broersma , The Ramsey numbers of large cycles versus small wheels, INTEGERS: Electronic Journal of Combinatorial Number Theory 4 (2004) A#10, 1-9.
  53. M. Baca, E.T. Baskoro, S. Jendrol, M. Miller, Antimagic labelings of hexagonal planar maps, Utilitas Math. 66 (2004), 231-238.
  54. A.A.G. Ngurah and E.T. Baskoro, On magic and antimagic total labeling of generalized Petersen graph, Utilitas Mathematica 63 (2003) 97-107
  55. E.T. Baskoro and A.A.G. Ngurah, On super edge-magic total labeling of nP3, Bull. Inst. Combin. Appl. 27 (2003), 82-87
  56. A.N.M. Salman, E.T. Baskoro, H.J. Broersma, C.A. Rodger, More on spanning 2-connected subgraph in truncated rectangular grid graphs, Bull. Inst. Combin. Appl. 39 (2003) 31-38.
  57. A.N.M. Salman, H.J. Broersma , and E.T. Baskoro, Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs, Journal of Automata, Languanges and Combinatorics 8 (2003) 4,  675-681.
  58. E.T. Baskoro, Surahmat, S.M. Nababan and  M. Miller, On Ramsey numbers  for trees versus wheels of five or six vertices,  Graphs and Combinatorics 18 (2002) 4, 717-721.
  59. E.T. Baskoro, M. Miller and J. Plesnik, Further results on almost Moore digraphs, Ars Combinatoria 56 (2000) 43-63.
  60. H. Iswadi and E.T. Baskoro, On (4,2)-digraphs with containing a cycle of length 2,  Bull. Malaysian Math. Sci. Soc. (2) 23 (2000) 1, 79-91.
  61. W.D. Wallis, E.T. Baskoro, M. Miller and Slamin, Edge-Magic total labelings Australas.  J.  Combin.  22 (2000) 177-190. 
  62. E.T. Baskoro, M. Miller and J. Plesnik, On the structure of digraphs with order close to the Moore bound,  Graphs Comb 14 (1998) 2, 109-119.
  63. E.T. Baskoro, L.Brankovic, M. Miller, J. Plesnik, J. Ryan and J. Siran, Large digraphs with small diameter: A voltage assignment approach, Journal of Combinatorial Mathematics and Combinatorial Computing 24 (1997) 161 - 176.
  64. E.T. Baskoro, M. Miller and J. Siran, A note on almost Moore digraphs of degree three, Acta Mathematica Universitatis Comenianae 66 (1997) 2, 285-291. 
  65. E.T. Baskoro and M. Miller, A procedure for constructing a  minimum-diameter digraph,  Bull. Inst. Combin. Appl. 17 (1996) 8-14.  
  66. E.T. Baskoro, M. Miller, J. Plesnik and S. Znam, Digraphs of degree 3 and order close to the Moore bound, Journal of Graph Theory 20 (1995) 339-349.
  67. E.T. Baskoro, M. Miller, J. Plesnik and S. Znam, Regular digraphs of diameter 2 and maximum order, Australasian Journal of Combinatorics 9 (1994) 291-306. Errata, 13 (1995).
 
National publications 

  1. I Wayan Sudarsana, E.T. Baskoro, H. Assiyatun, S. Uttunggadewa, The Ramsey numbers of linear forest versus 3K3 U 2K4, J. Indones. Math. Soc. (MIHMI) 15:1 (2009), 61-67.
  2. M. Baca, E.T. Baskoro, M. Miller, J. Ryan, R. Simanjuntak, K.A. Sugeng, Survey of edge antimagic labelings of graphs, J. Indones. Math. Soc. 12:1 (2006), 113-130.
  3. Nurdin, E.T. Baskoro, A.N.M. Salman, Total edge irregular strength on the union of K2,n ,  Jurnal Matematika dan Sain 11: 3 (2006) 105-109.
  4. E.T. Baskoro, I.W. Sudarsana, Y.M. Cholily, How to construct new super edge-magic graphs from some old ones, J. Indones. Math. Soc. (MIHMI) 11: 2 (2005), 155-162.
  5. M. Baca, E.T. Baskoro, Y.M. Cholily, S. Jendrol, Y. Lin, M. Miller, J. Ryan, R. Simanjuntak, Slamin, K.A. Sugeng, Conjectures and open problems on face antimagic evaluations of graphs, J. Indones. Math. Soc. (MIHMI) 11: 2 (2005), 175-192.
  6. E.T. Baskoro, Y.M. Cholily, Expanding super edge magic graphs, Proc. ITB Sains & Tek. 36:2 (2004), 117-125.
  7. E.T. Baskoro, On Ramsey-Type Problems, Jurnal Matematika atau Pembelajarannya, 9:1 (2003), 1-11.
  8. A.N.M. Salman, E.T. Baskoro, H.J. Broersma, A note concerning Hamilton cycles in some classes of grid graphs, Proceedings ITB Sains & Teknologi 35A:1 (2003) 65-70.
  9. E.T. Baskoro, The Ramsey number of paths and small wheels, Journal of the Indonesian Mathematical Society (MIHMI) 8 (2002) 1, 13-16.
  10. E.T. Baskoro and Amrullah, Almost Moore digraphs of degree 4 without selfrepeats, Journal of the Indonesian Mathematical Society (MIHMI), 8 (2002) 1,  51 – 60.
  11. Y.M. Cholily, E.T. Baskoro, Digraf Hampir Moore yang memuat segitiga, Jurnal Matematika dan Pembelajarannya, (2002).
  12. R. Simanjuntak and E.T. Baskoro, The uniqueness of almost Moore digraphs with degree 4 and diameter 2, Proceeding ITB 32 (2000) 1, 7-11 .
  13. E.T. Baskoro, On the existence of cubic digraphs with optimum order, The Indonesian Mathematical Society Magazine, MIHMI  2 (1997) 27-34.

Keynote and Invited Talks

  1. On The Existence of Almost Moore Digraphs, the 33rd Australasian Conference on Combinatorial Mathematics and Combinatorial Computing (33ACCMCC), December 7-11, 2009, Newcastle, Australia. 
  2. On the Existence of Almost Moore (Di)graphs, the 4th International Conference on Research and Education in Mathematics  (ICREM 4), Kuala Lumpur, Malaysia, October 21 - 23, 2009.
  3. On (Super) Edge-Magic Deficiency of Graphs, IndoMS International Conference on Mathematics and its application (IICMA2009), UGM Yogyakarta, October 12 – 13, 2009.
  4. Some progress on Ramsey numbers and Ramsey-minimal graphs, Asian Mathematical Conference, June 22-26, 2009 Kuala Lumpur Malaysia.
  5. On some Ramsey-minimal graphs, the 4th World Conference on the 21st Century Mathematics, March 4-8, 2009 Lahore Pakistan.
  6. Some Graph Ramsey Numbers and Ramsey-Minimal Graphs, the 3rd International Conference on Mathematics and Statistics (ICoMS-3), IPB Bogor, Indonesia, 5-6 August (2008), S2C-IS. 
  7. Ramsey numbers, edge-magic total labelings and secret sharing schemes, International Joint Symposium on Computational Science, Kanazawa University, Japan, 3-7 March (2008). 
  8. Graph Ramsey Numbers: old problem and new results, National University of Computer and Emerging Sciences, Lahore Pakistan, January 3, (2008).
  9. School on Ramsey numbers and Graph Labelings, Abdus Salam School of Mathematical Sciences, GC University Lahore Pakistan, 26 Dec 2007 – 23 January 2008.
  10. Ramsey numbers of complete bipartite graphs, International Conference on Mathematics and Applications ICMA-MU 2007, Bangkok Thailand, 15-17 August 2007.
  11. On the existence of Almost Moore digraphs, the 3rd International Conference on 21st Century Mathematics 2007, Lahore Pakistan, March 4-7, 2007, (Keynote).
  12. Various types of Ramsey numbers, Workshop/Conference on Algebra and Graph Theory, Lahore Pakistan, March 13-22, 2006.
  13. Total labelings on graphs, Workshop/Conference on Algebra and Graph Theory, Lahore Pakistan, March 13-22, 2006.
  14. On the Ramsey numbers of some fixed graphs versus wheels, Workshop on Cycles and Colorings, High Tatras, Slovakia, September 5-10, (2004).
  15. On the Ramsey Number of wheels versus other graphs, the 13-th Australasian Workshop on Combinatorial Algorithms (AWOCA), Australia, July 7-10, (2002). 
  16. On Ramsey-type problems, the 11th National Conference on Mathematics, Malang, July 21-24, (2002).

Comments