Edy Tri Baskoro
Email: baskoro@sms.edu.pk
Course: Combinatorics and Graph Theory
Published Papers
1. E.T. Baskoro and M. Miller, Open problems in constructing digraphs with minimal diameter, Proc. of the 5th Australasian Workshop on Combinatorial Algorithms, Bali Indonesia, 30 Juni - 4 Juli, (1992).
2. E.T. Baskoro and M. Miller, On the construction of networks with minimum diameter, The Australian Computer Science Communications 15 (1993) 1, Part C, 739-743.
3. 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).
4. 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.
5. E.T. Baskoro and M. Miller, A procedure for constructing a minimum-diameter digraph, Bull. Inst. Combin. Appl. 17 (1996) 8-14.
6. 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.
7. E.T. Baskoro, On the existence of cubic digraphs with optimum order, The Indonesian Mathematical Society Magazine, MIHMI 2 (1997) 27-34.
8. 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.
9. 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.
10. E.T. Baskoro, M. Miller and J. Plesnik, Further results on almost Moore digraphs, Ars Combinatoria 56 (2000) 43-63.
11. 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 .
12. 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.
13. W.D. Wallis, E.T. Baskoro, M. Miller and Slamin, Edge-Magic total labelings Australasian Journal of Combinatorics 22 (2000) 177-190.
14. K. Wijaya and E. T. Baskoro, Edge-magic total labeling on disconnected graphs, Proceedings of the eleventh Australasian Workshop on Combinatorial Algorithm, Australia (2000) 139-144.
15. K. Wijaya and E.T. Baskoro, Edge-magic total labeling on a disjoint union of cycle graphs (in Indonesian), Proceedings of the tenth national conference on mathematics, Bandung, July 18-20 (2000) 159 -163.
16. K. Wijaya and E.T. Baskoro, Edge-magic total labeling on a product of two graphs (in Indonesian), Proceedings of Mathematics and Natural Sciences Seminar, FMIPA ITB, Bandung, 13-14 November (2000) 140-144.
17. H. Y. Garminia and E.T. Baskoro, On almost Moore digraphs with defect more than one, Proceedings of Mathematics and Natural Sciences Seminar, FMIPA ITB, Bandung, 13-14 November (2000).
18. M. Baca, E.T. Baskoro, and M. Miller, On d-antimagic labelings of Honeycomb, Proceedings of the 12-th Australasian Workshop on Combinatorial Algorithms, Bandung, 14-17 July (2001) 45-50.
19. Slamin, E.T. Baskoro, and M. Miller, Diregularity of digraphs of out-degree three and order two less than Moore bound, Proceedings of the 12-th Australasian Workshop on Combinatorial Algorithms, Bandung, 14-17 July (2001) 164-173.
20. Surahmat and E.T. Baskoro, On the Ramsey Number of Path or Star versus W4 or W5, Proceedings of the 12-th Australasian Workshop on Combinatorial Algorithms, Bandung, 14-17 July (2001) 174-179.
21. E.T. Baskoro, The Ramsey number of paths and small wheels, Journal of the Indonesian Mathematical Society (MIHMI) 8 (2002) 1, 13-16.
22. 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.
23. 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.
24. E.T. Baskoro, On the graph Ramsey numbers R(G,Wm), Proceedings of the 13-th Australasian Workshop on Combinatorial Algorithms (AWOCA), Australia, July 7-10, (2002) 267-277.
25. Surahmat and E.T. Baskoro, The Ramsey number of a linear forest versus a wheel, Proceedings of the 13-th Australasian Workshop on Combinatorial Algorithms (AWOCA), Australia, July 7-10, (2002) 127-131.
26. A.N.M. Salman, E.T. Baskoro and H.J. Broersma, Spanning 2-connected subgraphs of alphabet graphs, special classes of grid graphs, Proceedings of the 13-th Australasian Workshop on Combinatorial Algorithms (AWOCA), Australia, July 7-10, (2002) 151-161.
27. E.T. Baskoro, Pelabelan Total-Sisi Ajaib, Proceeding dari Konferensi Nasional Matematika XI, Malang, 21-24 July 2002.
28. Y.M. Cholily, E.T. Baskoro, Digraf Hampir Moore yang memuat segitiga, Jurnal Matematika dan Pembelajarannya, (2002).
29. A.A.G. Ngurah and E.T. Baskoro, On magic and antimagic total labeling of generalized Petersen graph, Utilitas Mathematica 63 (2003) 97-107
30. E.T. Baskoro and A.A.G. Ngurah, On super edge-magic total labeling of nP3, Bull. Inst. Combin. Appl. 27 (2003), 82-87
31. 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.
32. 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.
33. 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.
34. E.T. Baskoro, On Ramsey-Type Problems, Jurnal Matematika atau Pembelajarannya, 9 (2003) 1, 1- 11.
35. Y.M. Cholily, E.T. Baskoro, Necessary conditions for the existence of almost Moore digraphs, Proc. Of the SEAMS-GMU Conference 2003, published (2004), 141-147.
36. E.T. Baskoro, Y.M. Cholily, M. Miller, On the structure of (d,3)-digraphs containing selfrepeats, Proc. AWOCA 2004, Balina Australia, July 7-9 (2004).
37. 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.
38. E.T. Baskoro, Y.M. Cholily, Expanding super edge magic graphs, Proc. ITB Sains & Tek. 36:2 (2004), 117-125.
39. M. Baca, E.T. Baskoro, S. Jendrol, M. Miller, Antimagic labelings of hexagonal planar maps, Utilitas Math. 66 (2004), 231-238.
40. Y.M. Cholily , E.T. Baskoro, S. Uttunggadewa, Some conditions of the existence of (d,k)-digraphs, Combinatorial Geometry and Graph Theory (J. Akiyama et al. Eds.), IJCCGGT 2003, LNCS 3330, Springer-Verlag, Berlin (2005) 87- 93.
41. Surahmat, E.T. Baskoro, S. Uttunggadewa and H. Broersma, An upper bound for the Ramsey number of cycle of length four versus wheels, Combinatorial Geometry and Graph Theory (J. Akiyama et al. Eds.), IJCCGGT 2003, LNCS 3330, Springer-Verlag, Berlin (2005) 181-184.
42. M. Baca , E.T. Baskoro, M. Miller, Antimagic valuations for the special class of plane graphs, Combinatorial Geometry and Graph Theory (J. Akiyama et al. Eds.), IJCCGGT 2003, LNCS 3330, Springer-Verlag, Berlin (2005) 55- 61.
43. 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.
44. Surahmat, E.T. Baskoro, H.J. Broersma, The Ramsey numbers of fans versus K_4, Bull. Inst. Combin. Appl. 43 (2005) 96-102.
45. E.T. Baskoro, Surahmat, The Ramsey number of paths with respect to wheels, Discrete Mathematics 294 (2005) 275-277.
46. 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.
47. 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.
48. E.T. Baskoro, R. Simanjuntak, M.T. Adhitia, Secret Sharing Schemes Based on Magic Labelings, Proceeding of National Conference on Mathematics XII, 23-27 July 2004, Bali.
49. E.T. Baskoro, R. Simanjuntak, M.T. Adhitia, Two-Level Secret Sharing Schemes Based on Magic Labelings, Proceeding of Indonesia Cryptology and Information Security Conference 2005, 30-31 Maret, (2005) 151-154.
50. 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.
51. Hasmawati, E.T. Baskoro, H. Assiyatun, Star-wheel Ramsey numbers, J. Combin. Math. Combin. Comput. 55 (2005), 123--128.
52. Syafrizal Sy., E.T. Baskoro, S. Uttunggadewa, The size multipartite Ramsey numbers for paths. J. Combin. Math. Combin. Comput. 55 (2005), 103--107.
53. 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.
54. 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.
55. E.T. Baskoro, Critical sets in edge-magic total labelings, J. Combin. Math. Combin. Comput. 55 (2005), 33--42.
56. 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.
57. 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.
58. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the (a,d)-antimagic total labelling of $mC_n$, to appear in Bull. Inst. Combin. Appl. 48 (2006).
59. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, S. Uttunggadewa, On edge-magic total labeling of kC4-snakes, to appear in Congressus Numerantium , December (2006), 173-183.
In Press
1. 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., to
appear.
2. A.A.G. Ngurah, E.T. Baskoro, R. Simanjuntak, On the new families of (super)
edge-magic graphs, to appear in Utilitas Math. (2007).
Preprints
1. Surahmat, E.T. Baskoro and H.J. Broersma, The Ramsey
numbers of large star-like trees versus large odd wheels, preprint (2002).
2. E.T. Baskoro, Y.M. Cholily, M. Miller, Enumeration of vertex orders of almost
Moore digraphs with selfrepeats, submitted to Discrete Math (2005).
3. Surahmat, E.T. Baskoro, I. Tomescu, The Ramsey numbers of large cycles versus
wheels, submitted (January 2006)
4. Surahmat, E.T. Baskoro, I. Tomescu, The Ramsey numbers of large cycles versus
odd wheels, submitted (January 2006).
5. Syafrizal Sy, E.T. Baskoro, S. Uttunggadewa, The size multipartite Ramsey
numbers for small paths versus other graphs, submitted (March 2006).
6. E.T. Baskoro, Hasmawati, H. Assiyatun, The Ramsey numbers for disjoint unions
of trees, submitted (March 2006).
7. Nurdin, E.T. Baskoro, A.N.M. Salman, Total edge irregular strength on the
union of $K_{2,n}$, submitted (February, 2006).