Publication

  • L. Susilowati, M.I. Utoyo, and Slamin, On commutative characterization of generalized comb and corona products of graphs with respect to the local metric dimension, Far East Journal of Mathematical Sciences 100 (4) (2016), pp. 643-660.
  • S. Bukhori, W. Utami, and Slamin, Hybrid profile matching and forest fire model strategies in serious game supply chain management agribusiness, International Journal of Supply Chain Management 5 (3) (2016), pp. 25-31.
  • L. Susilowati, M.I. Utoyo, N. Estuningsih, and Slamin, The similarity of metric dimension and local metric dimension of rooted product graph (with ), Far East Journal of Mathematical Sciences 97 (7) (2015), pp. 841-856.
  • J.M. Aroca, A. Lladó, and Slamin, On the ascending subgraph decomposition problem for bipartite graphs, Discrete Mathematics Vol. 46 (1) (2014), pp. 19-26.
  • A. Ahmad, S. A. Bokhary, R. Hasni, and Slamin, Total vertex irregularity strength of ladder related graphs, Sci.Int. (Lahore) Vol. 26 (1) (2014), pp. 1-5.
  • I. Javaid, A. Ismail, M. Salman, A. Ahmad, and Slamin, Labeling of Chordal Rings, Utilitas Mathematica, Vol. 90 (2013) pp. 61-75.
  • Mirka Miller, Joe Ryan, Edy Tri Baskoro, and Slamin, Construction Techniques for Digraphs with Minimum Diameter, Combinatorial Algorithms Lecture Notes in Computer Science Vol 8288 (2013) pp 327-336.
  • M. T. Rahim and Slamin, Vertex-magic total labeling of the union of suns, Ars Combinatoria Vol 103 (2012) 305-310.
  • Slamin; Dafik; Wyse Winnona, Total Vertex Irregularity Strength of the Disjoint Union of Sun Graphs, International Journal of Combinatorics., Vol. 2012 (PDF File)
  • Ali Ahmad, K.M. Awan, Imran Javaid and Slamin, Total vertex irregularity strength of wheel related graphs, Australasian Journal of Combinatorics Vol.51 (2011) 147 – 156.
  • K. Wijaya; Slamin; Mirka Miller, On Total Vertex Irregularity Strength Cocktail Party Graphs, Jurnal Ilmu Dasar, Vol. 12 No. 2 (2011) 148 – 151. (PDF File)
  • Slamin; Mirka Miller, On the Existence of Non-Diregular Digraphs of Order Two less than the Moore BoundJurnal Ilmu Dasar, Vol. 12 No. 1 (2011) 1 – 5. (PDF File)
  • M. Hussain; E. T. Baskoro; Slamin, On super edge-magic total labeling of banana trees, Utilitas Math., Vol. 79 (2009), 243-251.
  • Slamin, Diregularity of large directed graphs, Proceedings of the 5th Asian Mathematical Conference, Vol. I (2009), 465 – 470.
  • D. R. Silaban; A. Parestu; B.N. Herawati; K.A. Sugeng; Slamin, Vertex magic total labeling of unions of generalized Petersen graphs and unions of special circulant graphs, Journal of Combinatorial Mathematics and Combinatorial Computing Vol 71 (2009), 201 – 207.
  • M.T. Rahim; Slamin, Most wheel related graphs are not vertex magic, Utilitas Mathematica Vol. 77 (2008) 193 – 199.
  • K. Wijaya; Slamin, Total vertex irregular labelings of wheels, fans, suns and friendship graph, Journal of Combinatorial Mathematics and Combinatorial Computing Vol. 65 (2008) 103 – 112.
  • M.T. Rahim; I. Tomescu; Slamin, On vertex-magic total labeling of some wheel related graphs, Utilitas Mathematica, Vol. 73 (2007) pp. 97 – 104.
  • I. Tomescu; I. Javaid; Slamin, On the partition dimension and connected partition dimension of wheels, Ars Combinatoria, Vol. 84 (2007) pp. 311 – 318.
  • Slamin; A.C. Prihandoko; T.B. Setiawan; F. Rosita; B. Shaleh, Vertex-magic total labelings of disconnected graphs, Journal of Prime Research in Mathematics, Vol. 2 (2006) pp. 147-156. (PDF File)
  • Slamin, Classification of construction techniques of large directed graphs, Jurnal Ilmu Dasar Vol. 7 No. 2 (2006) p. 188-193.
  • Baca, M.; Baskoro, E. T.; Cholily, Y. M.; Jendrol, S.; Lin, Y.; Miller, M.; Ryan, J.; Simanjuntak, R.; Slamin; Sugeng, K. A., Conjectures and open problems on face antimagic evaluations of graphs, J. Indones. Math. Soc. 11 (2005), no. 2, 175–192. (PDF File)
  • Wijaya, K.; Slamin; Surahmat; Jendrol, S., Total vertex irregular labeling of complete bipartite graphs, JCMCC 55 (2005), pp. 129-136.
  • Miller, Mirka; Patel, Deval; Ryan, Joe; Sugeng, Kiki A.; Slamin; Tuga, Mauritsius, Exclusive sum labeling of graphs, J. Combin. Math. Combin. Comput. 55 (2005), pp. 137-148.
  • Balbuena, C.; Barker, E.; Das, K. C.; Lin, Y.; Miller, M.; Ryan, J.; Slamin; Sugeng, K.; Tkac, M., On the degrees of a strongly vertex-magic graph, Discrete Math. 306 (2006), no. 6, pp. 539-551.
  • K.A. Sugeng, M. Miller, Slamin and M. Baca, (a,d)-Edge-Antimagic Total Labelings of Caterpillars, Lecture Notes in Computer Science Volume 3330 (J. Akiyama, E.T. Baskoro, M. Kano (eds)) 2005 pp. 169-180.
  • Y. Lin, Slamin, M. Baca, and Mirka Miller, On d-antimagic labelings of prisms, Ars Combinatoria Vol. 72 (2004) pp.65-76 .
  • Y. Lin, Slamin, Mirka Miller, On d-antimagic labelings of antiprisms, Utilitas Mathematica 64 (2003), pp. 213-220.
  • Miller, M., Ryan, J., Slamin, Sugeng, K. and Tuga, M., Open problems in exclusive sum graph labeling, Proceedings of the Fourteenth Australasian Workshop on Combinatorial Algorithms (2003) pp.125-130.
  • M. Baca, F. Bertault, J.A. MacDougall, Mirka Miller, Rinovia Simanjuntak, and Slamin, Vertex-antimagic total labelings of graphs, Discussiones Mathematicae Graph Theory Vol.23 No.1 (2003) pp. 67 – 83. (PDF File)
  • Baca, M., Miller, M. and Slamin, Vertex-magic total labelings of generalized Petersen graphs, Int. J. of Computer Mathematics, Vol.79, Issue 12, (2002) pp.1259-1264.
  • Slamin, Construction of digraphs with minimum diameter, Prosiding Konperensi Nasional Matematika XI Bag. I, Jurnal Matematika dan Pembelajarannya Tahun VIII, Edisi Khusus (2002) pp. 311 – 316.
  • Mirka Miller, H. M. Nguyen and Slamin, Construction techniques for diregular and non-diregular large directed networks, Proceedings of 13th Australasian Workshop on Combinatorial Algorithms (2002) pp. 85 – 96.
  • Slamin, E. T. Baskoro and Mirka Miller, Diregularity of digraphs of out-degree three and order two less than Moore bound, Proceedings of 12th Australasian Workshop on Combinatorial Algorithms (2001) pp. 164 – 173.
  • Slamin, M. Baca, Y. Lin, Mirka Miller and Rinovia Simanjuntak, Edge-magic total labelings of wheels, fans and friendship graphs, Bulletin of ICA 35 (2002) pp. 89 – 98.
  • J. A. McDougall, Mirka Miller, Slamin and W. D. Wallis, Vertex-magic total labelings of graphs, Utilitas Math, 61 (2002) pp. 3 – 21.
  • H. Nagamochi, Mirka Miller and Slamin, Bounds on the number of isolates in sum graph labeling, Discrete Mathematics 240 (2001) pp. 175 – 185.
  • Slamin, Survey of magic total labellings of graphs, Saintifika Vol. 2 No. 1 (2001) pp. 287 – 298.
  • Slamin, Existence of large directed graphs, Saintifika Vol. 2 No. 3 (2001) pp. 481 – 490.
  • Slamin, Moore graphs and large graphs close to Moore bound, Saintifika Vol. 2 No. 4 (2001) pp. 548 – 558.
  • Slamin and Mirka Miller, On two conjectures concerning vertex magic total labelings of generalized Petersen graphs, Bulletin of ICA 32 (2001) pp. 9-16.
  • M. Baca, J. A. McDougall, Mirka Miller, Slamin and W. D. Wallis, On certain valuations of graphs, Discussiones Mathematicae Graph Theory Vol 20 No 2 (2000) pp. 219 – 229. (PDF File)
  • W. D. Wallis, E. T. Baskoro, Mirka Miller and Slamin, Edge-magic total labelings, Australasian Journal of Combinatorics 22 (2000) pp. 177-190. (PDF File)
  • Mirka Miller, J. Gimbert, J. Siran and Slamin, Almost Moore digraphs are diregular, Discrete Mathematics 218 No.1-3 (2000) pp. 265-270.
  • M. Baca, Mirka Miller, and Slamin, Every generalized Petersen graph has a vertex-magic total labeling, Proceedings of Eleventh Australasian Workshop on Combinatorial Algorithms (2000) pp. 1-6.
  • Lin, Y., Miller, M., Simanjuntak, R. and Slamin, Magic and antimagic labelings of wheels, Proceedings of Eleventh Australasian Workshop on Combinatorial Algorithms (2000) pp.67-74.
  • Slamin and Mirka Miller, Diregularity of digraphs close to Moore bound, Prosiding Konperensi Nasional Matematika X, MIHMI Vol.6 No.5 (2000) pp.185-192.
  • Slamin and Mirka Miller, Sum graph labellings and related problems, MIHMI Vol. 6 No. 1 (2000) pp. 35-45.
  • Mirka Miller and Slamin, On the monotonicity of minimum diameter with respect to order and maximum out-degree, Proceedings of COCOON 2000, Lecture Notes in Computer Science 1858 (D.-Z. Du, P. Eades, V. Estivill-Castro, X. Lin (eds.)) (2000) pp. 193-201.
  • Mirka Miller, J. A. McDougall, Slamin and W. D. Wallis, Problems in magic total labellings, Proceedings of Tenth Australasian Workshop on Combinatorial Algorithms, (1999) pp. 19-25.
  • Slamin and Mirka Miller, Open problems in sum and integral sum graph labellings, Proceedings of Eight Australasian Workshop on Combinatorial Algorithms (1997) pp. 71-75.
  • M. Sutton, Mirka Miller, J. Ryan, and Slamin, Open problems in mod sum graphs, Proceedings of Eight Australasian Workshop on Combinatorial Algorithms (1997) pp. 76-78.
  • Mirka Miller, J. Ryan, Slamin, and W.F. Smyth, Labelling wheels for minimum sum number, JCMCC 28 (1998) pp. 289-297.
  • M. Sutton, Mirka Miller, J. Ryan, and Slamin, Connected graphs which are not mod sum graphs, Discrete Mathematics (195) 1-3 (1999) pp. 287-293.
  • Mirka Miller, J. Ryan and Slamin, Integral sum numbers of the cocktail party graphs and the symmetric complete bipartite graphs, Bulletin of ICA 25, (1999) pp. 23-28.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>