SAAD I. EL-ZANATI Addresses: Office Home Department of Mathematics 2159 County Road 355N Illinois State University Carlock, IL 61725 Normal, IL 61790-4520 (309)438{5765 (309)376{3776 E-mail Address: [email protected] Web Site: http://math.illinoisstate.edu/saad/ Education: Ph.D., Mathematics, Auburn University (1991). M.S., Mathematics, Auburn University (1987). B.S., Computer Engineering, Auburn University (1983). Ph.D. Dissertation: Graph Designs, Auburn University (1991). Advisor: Christopher A. Rodger. Experience: • Professor, Department of Mathematics, Illinois State University, 2000{present. • Associate Professor, Department of Mathematics, Illinois State University, 1996{2000. • Assistant Professor, Department of Mathematics, Illinois State University, 1991{1996. • Instructor, Department of Mathematics, Tuskegee University, 1987{1988. • Graduate Teaching Assistant, Department of Mathematics, Auburn University, 1984{ 1991. Courses Taught at Illinois State University: (*indicates topics I developed) Calcu- lus I, II, & III, Elementary Linear Algebra, Introduction to Real Analysis, Introduction to Discrete Mathematics, Discrete Mathematics, Honors Undergraduate Research I & II, History of Math to 1600, Advanced Linear Algebra, Advanced Calculus, Topics in Discrete Mathematics: Coding Theory*, Topics in Discrete Mathematics: Design Theory*, Advanced Topics in Discrete Mathematics: Design Theory*, Graph Theory, Independent Study, Topics in Mathematics for Secondary School Teachers*, Introduction to Undergraduate Research in Mathematics*, Undergraduate Research in Mathematics II*, Summer Research in Math- ematics*, Mathematics for Secondary Teachers, Teaching Methods, Foundations of Inquiry. 1 Publications: (*indicates undergraduate co-author; **indicates graduate co-author) 74. On decompositions of complete multipartite graphs into the union of two even cycles, submitted. (with J. Buchanan*, R. C. Bunge**, E. Pelttari*, G. Rasmuson**, A. Su, and S. Tagaris*) 2 73. On the index 2 spectra of bipartite subgraphs of K4, submitted. (with S. Allen*, J. Bolt**, R. C. Bunge**, and S. Burton*) 72. On decomposing even regular multigraphs into small isomorphic trees, submitted. (with M. J. Plantholt, and S. K. Tipnis) 71. On decomposing regular graphs into isomorphic double-stars, submitted. (with M. Er- mete*, J. Hasty, M. J. Plantholt, and S. K. Tipnis) 70. On cyclic decompositions of Kn+1;n+1 −I into a 2-regular graph with at most 2 compo- nents, submitted. (with R. C. Bunge, D. Gibson*, U. Jongthawonwuth**, J. Nagel*, B. Stanley*, and A. Zale*) 69. On standard Stanton 4-cycle designs, submitted. (with R. C. Bunge, A. Hakes*, J. Jef- fries*, E. Mastalio*, and J. Torf*) 68. The spectrum for the Stanton 3-cycle, Bulletin for the Institute for Combinatorics and its Applications, to appear. (with W. Lapchinda**, P. Tangsupphathawat**, and W. Wannasit) 67. On the cyclic decomposition of circulant graphs into bipartite graphs, Australasian Journal of Combinatorics, Vol. 56 (2013), 201{217. (with R. C. Bunge**, C. Rumsey**, and C. Vanden Eynden) 66. On labeling 2-regular graphs where the number of odd components is at most 2, Utilitas Mathematica, Vol. 91 (2013), 261{285. (with R. C. Bunge*, M. Hirsch*, D. Klope*, J. A. Mudrock*, K. Sebesta**, and B. Shafer) 65. On cyclic decompositions of complete graphs into tripartite graphs, Journal of Graph Theory, Vol. 72 (2013), 90{111. (with R. C. Bunge**, A. Chantasartrassmee**, and C. Vanden Eynden) 64. On γ-labeling the almost-bipartite graph Pm + e, Ars Combinatoria, Vol. 107 (2012), 65{80. (with R. C. Bunge** and W. O'Hanlon**) 63. All 2-regular graphs with uniform odd components admit ρ-labelings, Australasian Journal of Combinatorics, Vol. 53 (2012), 207{219. (with D. I. Gannon*) 62. On G-designs, where G is the one-point union of two cycles, Journal of Combina- torial Mathematics and Combinatorial Computing, Vol. 83 (2012), 261{289 . (with K. Brewington*, R. C. Bunge**, L. J. Cross**, C. K. Pawlak*, J. L. Smith*, and S. M. Zeppetello*) 2 61. On free α-labelings of cubic bipartite graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 82 (2012), 269{293. (with W. Wannasit**) 60. On graceful cubic graphs, Congressus Numerantium, Vol. 208 (2011), 167{182. (with W. Wannasit**) 59. On cyclic G-designs, where G is cubic and tripartite, Discrete Mathematics, Vol. 312 (2011), 293{305. (with W. Wannasit**) 58. On λ-fold Partitions of Finite Vector Spaces and Duality, Discrete Mathematics, Vol. 311 (2011), 307{318. (with G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden) 57. On ρ-labeling 2-regular graphs consisting of 5-cycles, International Journal of Mathe- matics and Computer Science, Vol. 6 (2011), 13{20. (with D. I. Gannon*) 56. On cyclic decompositions of circulant graphs into almost bipartite graphs, Australasian Journal of Combinatorics, Vol. 49 (2011), 6{76. (with K. King* and J. A. Mudrock*) 55. Partitions of the 8-dimensional vector space over GF(2), Journal of Combinatorial Designs, Vol. 18 (2010), 462{474. (with O. Heden, G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden) 54. The maximum size of a partial 3-spread in a finite vector space over GF(2), Designs, Codes, & Cryptography, Vol. 54 (2010), 101{107. (with H. Jordon, G. F. Seelinger, P. A. Sissokho, and L. E. Spence) 53. Gregarious GDDs with two associate classes, Graphs and Combinatorics, Vol. 26 (2010), 775{780. (with N. Punnim and C. A. Rodger) 52. The nonexistence of a (K6 − e)-decomposition of the complete graph K29, Journal of Combinatorial Designs, Vol. 18 (2010), 94{104. (with D. Bryant, S. Hartke, and P. R. J. Osterg^ard)¨ 51. On cyclic (C2m + e)-designs, Ars Combinatoria, Vol. 93 (2009), 289{304. (G. Blair*, D. Bowman*, S. Hlad*, M. Priban*, and K. Sebesta*) 50. On rho-labeling up to ten vertex-disjoint C4x+1, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 70 (2009), 161{176. (with E. Butzen*, H. Jordon, A. Modica*, and E. Schrishuhn*) 49. On Rosa-type labelings and cyclic decompositions, Mathematica Slovaca, Vol. 59 (2009), 1{18. (with C. Vanden Eynden) 48. On Partitions of Finite Vector Spaces of Low Dimension Over GF(2), Discrete Mathe- matics, Vol. 309 (2009), 4727{4735. (with G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden) 3 47. On γ-labeling the almost-bipartite graph Km;n +e, East{West Journal of Mathematics, Vol. 10 (2008), 119{126. (with W. O'Hanlon** and E. R. Spicer) 46. On vector space partitions and uniformly resolvable designs, Designs, Codes, & Cryp- tography, Vol. 48 (2008), 69{77. (with A. D. Blinco, G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden) 45. Partitions of finite vector spaces into subspaces, Journal of Combinatorial Designs, Vol. 16 (2008), 329{341. (with G. F. Seelinger, P. A. Sissokho, L. E. Spence, and C. Vanden Eynden) 44. On σ-labeling the union of three cycles, Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 64 (2008), 33{48. (with A. Aguado*) 43. On ρ-labeling the union of three cycles, Australasian Journal of Combinatorics, Vol. 37 (2007), 155{170. (with A. Aguado*, H. Hake*, J. Stob*, and H. Yayla*) 42. Graph decompositions and designs, CRC Handbook of Combinatorial Designs, Second Edition, C. J. Colbourn and J. H. Dinitz, Editors, 2007, 477{485. (with D. E. Bryant) (r) 41. On the existence of a rainbow 1-factor in 1-factorizations of Krn , Journal of Combi- natorial Designs, Vol. 15 (2007), 487{490. (with M. J. Plantholt, P. A. Sissokho, and L. E. Spence) 40. Decomposing complete graphs into cubes, Discussiones Mathematicae{Graph Theory, Vol. 26 (2006), 141{147. (with C. Vanden Eynden) 39. Decompositions of complete graphs into 5-cubes, Journal of Combinatorial Designs, Vol. 14 (2006), 159{166. (with D. E. Bryant, B. Maenhaut, and C. Vanden Eynden) 38. On labeling the union of two cycles, Journal of Combinatorial Mathematics and Com- binatorial Computing, Vol. 53 (2005), 3{11. (with J. Dumouchel*) 37. On the cyclic decomposition of complete graphs into almost-bipartite graphs, Discrete Mathematics, Vol. 284 (2004), 71{81. (with A. Blinco and C. Vanden Eynden) 36. On a generalization of the Oberwolfach problem, Journal of Combinatorial Theory, Series A, Vol. 106 (2004), 255{275. (with N. Cavenagh, A. Khodkar, and C. Vanden Eynden) 35. Labelings of unions of up to four uniform cycles, Australasian Journal of Combinatorics, Vol. 29 (2004), 323{336. (with D. Donovan, S. Sutinontopas, and C. Vanden Eynden) 34. A note on the cyclic decomposition of complete graphs into bipartite graphs, Bulletin of the ICA, Vol. 40 (2004), 77{82. (with A. Blinco**) 4 33. Factorizations of the complete graph into C5-factors and 1-factors, Graphs and Com- binatorics, Vol. 19 (2003), 289{296. (with P. Adams, D. E. Bryant, and H. Gavlas) 32. Least common multiples of cubes, Bulletin of the ICA, Vol. 38 (2003), 45{49. (with P. Adams, D. E. Bryant, B. Maenhaut, and C. Vanden Eynden) 31. A generalization of the Oberwolfach problem, Journal of Graph Theory, Vol. 41 (2002), 151{161. (with S. Tipnis and C. Vanden Eynden) 30. On the Hamilton-Waterloo problem, Graphs and Combinatorics, Vol. 18 (2002), 31{51. (with P. Adams, E. J. Billington, and D. E. Bryant) 29. Factorizations of and by powers of complete graphs, Discrete Mathematics, Vol. 243 (2002), 201{205. (with D. E. Bryant and C. Vanden Eynden) 28. On α-valuations of disconnected graphs, Ars Combinatoria, Vol. 61 (2001), 129{136. (with C. Vanden Eynden) 27. On the cyclic decomposition of complete graphs into bipartite graphs, Australasian Journal of Combinatorics, Vol. 24 (2001), 209{219. (with N. Punnim and C. Vanden Eynden) 26. Star decompositions of cubes, Graphs and Combinatorics, Vol. 17 (2001), 55{59. (with D. E. Bryant, D. G. Hoffman, and C. Vanden Eynden) 25. Star factorizations of graph products, Journal of Graph Theory, Vol. 36 (2001), 59{66. (with D. E. Bryant and C.