DOCSLIB.ORG

Saad I. El-Zanati

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

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.
Recommended publications
  • Brian Alspach and His Work

    Brian Alspach and His Work

    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Mathematics 299 (2005) 269–287 www.elsevier.com/locate/disc Brian Alspach and his workଁ Joy Morrisa, Mateja Šajnab aDepartment of Mathematics and Computer Science, University of Lethbridge, Lethbridge, AB, Canada T1K 3M4 bDepartment of Mathematics and Statistics, University of Ottawa, 585 King Edward Avenue, Ottawa, Ont. Canada K1N 6N5 Received 28 February 2005; received in revised form 9 March 2005; accepted 11 March 2005 Available online 26 July 2005 Abstract This article provides an overview of the life and work of Brian Alspach, including a complete list of his mathematical publications (to date). © 2005 Elsevier B.V. All rights reserved. Keywords: Alspach; Brian Alspach; Tournaments; Permutation groups; Graphs; Decompositions; Factorizations; Hamilton cycles; Biography 0. Introduction It’s hard to think of Brian Alspach these days, without conjuring up a mental picture of feet in Birkenstocks, and his Australian hat within arm’s reach, if not perched on his head. Often, a briefcase will be stashed nearby, if he isn’t actually carrying it. These outward symbols are accurate reflections of Brian’s character.Although his outlook is casual and laid-back, his attention rarely strays far from his passions in life, which include the work that is stored in that briefcase. ଁ This research was supported in part by the Natural Sciences and Engineering Research Council of Canada. E-mail addresses: [email protected] (J. Morris),[email protected] (M. Šajna). 0012-365X/$ - see front matter © 2005 Elsevier B.V.
  • On Bipartite 2-Factorisations of K N − I and the Oberwolfach Problem

    On Bipartite 2-Factorisations of K N − I and the Oberwolfach Problem

    On bipartite 2-factorisations of Kn − I and the Oberwolfach problem Darryn Bryant ∗ Peter Danziger † The University of Queensland Department of Mathematics Department of Mathematics Ryerson University Qld 4072 Toronto, Ontario, Australia Canada M5B 2K3 Abstract It is shown that if F1,F2,...,Ft are bipartite 2-regular graphs of order n and n−2 α1, α2, . , αt are non-negative integers such that α1+α2+···+αt = 2 , α1 ≥ 3 is odd, and αi is even for i = 2, 3, . , t, then there exists a 2-factorisation of Kn −I in which there are exactly αi 2-factors isomorphic to Fi for i = 1, 2, . , t. This result completes the solution of the Oberwolfach problem for bipartite 2- factors. 1 Introduction The Oberwolfach problem was posed by Ringel in the 1960s and is first mentioned in [19]. It relates to specification of tournaments and specifically to balanced seating arrangments at round tables. In this article we will provide a complete solution to the Oberwolfach problem in the case where there are an even number of seats at each table. Let n ≥ 3 and let F be a 2-regular graph of order n. When n is odd, the Oberwol- fach problem OP(F ) asks for a 2-factorisation of the complete graph Kn on n vertices ∗Supported by the Australian Research Council †Supported by NSERC in which each 2-factor is isomorphic to F . When n is even, the Oberwolfach problem OP(F ) asks for a 2-factorisation of Kn − I, the complete graph on n vertices with the edges of a 1-factor removed, in which each 2-factor is isomorphic to F .
  • The Oberwolfach Problem

    The Oberwolfach Problem

    Merging Combinatorial Design and Optimization: the Oberwolfach Problem Fabio Salassaa, Gabriele Dragottoc,a,∗, Tommaso Traettad, Marco Burattie, Federico Della Crocea,b affabio.salassa, [email protected] Dipartimento di Ingegneria Gestionale e della Produzione, Politecnico di Torino (Italy) bCNR, IEIIT, Torino, Italy [email protected] Canada Excellence Research Chair in Data Science for Real-time Decision-making, Ecole´ Polytechnique de Montr´eal(Canada) [email protected] DICATAM, Universit`adegli Studi di Brescia (Italy) [email protected] Dipartimento di Matematica e Informatica, Universit`adegli Studi di Perugia (Italy) Abstract The Oberwolfach Problem OP (F ) { posed by Gerhard Ringel in 1967 { is a paradigmatic Combinatorial Design problem asking whether the com- plete graph Kv decomposes into edge-disjoint copies of a 2-regular graph F of order v. In this paper, we provide all the necessary equipment to generate solutions to OP (F ) for relatively small orders by using the so-called differ- ence methods. From the theoretical standpoint, we present new insights on the combinatorial structures involved in the solution of the problem. Com- putationally, we provide a full recipe whose base ingredients are advanced optimization models and tailored algorithms. This algorithmic arsenal can solve the OP (F ) for all possible orders up to 60 with the modest comput- ing resources of a personal computer. The new 20 orders, from 41 to 60, encompass 241200 instances of the Oberwolfach Problem, which is 22 times greater than those solved in previous contributions. arXiv:1903.12112v4 [math.CO] 10 Nov 2020 Keywords: Combinatorics, Graph Factorization, Integer Programming, Combinatorial Design, Oberwolfach Problem, Constraint Programming ∗Corresponding author.
  • Hamilton-Waterloo Problem with Triangle and C9 Factors

    Hamilton-Waterloo Problem with Triangle and C9 Factors

    Michigan Technological University Digital Commons @ Michigan Tech Dissertations, Master's Theses and Master's Dissertations, Master's Theses and Master's Reports - Open Reports 2011 Hamilton-Waterloo problem with triangle and C9 factors David C. Kamin Michigan Technological University Follow this and additional works at: https://digitalcommons.mtu.edu/etds Part of the Mathematics Commons Copyright 2011 David C. Kamin Recommended Citation Kamin, David C., "Hamilton-Waterloo problem with triangle and C9 factors", Master's Thesis, Michigan Technological University, 2011. https://doi.org/10.37099/mtu.dc.etds/207 Follow this and additional works at: https://digitalcommons.mtu.edu/etds Part of the Mathematics Commons THE HAMILTON-WATERLOO PROBLEM WITH TRIANGLE AND C9 FACTORS By David C. Kamin A THESIS Submitted in partial fulfillment of the requirements for the degree of MASTER OF SCIENCE Mathematical Sciences MICHIGAN TECHNOLOGICAL UNIVERSITY 2011 c 2011 David C. Kamin This thesis, “The Hamilton-Waterloo Problem with Triangle and C9 factors”, is hereby approved in partial fulfillment of the requirements for the Degree of MASTER OF SCI- ENCE IN MATHEMATICAL SCIENCES. Department of Mathematical Sciences Signatures: Thesis Advisor Dr. Melissa Keranen Co-Advisor Dr. Sibel Ozkan¨ Department Chair Dr. Mark Gockenbach Date Contents List of Figures . vii Acknowledgements . ix Abstract . xi 1 Introduction . 1 1.1 Graph Decomposition . 1 1.2 The Oberwolfach Problem . 3 1.3 The Hamilton-Waterloo Problem . 4 1.4 Graph Theory . 6 1.5 The Mathematical Connection . 8 1.6 Previous Results . 9 1.7 Design Theory . 11 2 Generating URDs for fixed r, s .......................... 13 3 When m = 3 and n = 9 .............................
  • Mathematisches Forschungsinstitut Oberwolfach

    Mathematisches Forschungsinstitut Oberwolfach

    MATHEMATISCHES FORSCHUNGSINSTITUT OBERWOLFACH Tag u n 9 s b e r i c ht ")1/1984 Graphentheorie 8.7. bis 14.7.1984 Die Tagung fand unter der Leitung von' Herrn' G. Ringel (Santa Cruz, California) und Herrn W. Mader (Hannover) statt. Mehr als 40 Teilnehmer aus 13 Ländern (Australien, 'VR " China, CSSR, Dänemark, England, Frankreich, ISI;'ael,.·· Jugoslawien, Kanada, Niederlande, Ungarn, USA) haben über ihre n~uesten Ergebnisse in verschiedenen Gebieten der Graphentheorie b~richtet. In einer von Herrn P. Er~' dös geleiteten Problemsitzung wurden offene Probleme' vorgestellt und diskutiert. Im besonderen wurden Resultate aus den folgenden Teil- ~ gebieten der Graphentheorie vorgetragen: Färbungsprobleme, (Kanten- bzw. Knotenfärbunge~/·Larid~· ka.rten) , zusammennangsprobleme, Unendliche. Graphen, Einbettungen.von Graphen in verschiedene Fiächen, (Mini­ malbasen, Kantenkreuzungen), Partitionen (Turan-Graphen, Ramsey-Theorie usw.), . ~. .. '\ Wege und Kreise in Graphen. Darüber hinaus wurden graphentheoretische Methoden be- © nutzt im Zusammenhang mit Matroiden, Netzwerken, Opti­ mierungsproblemen,' physikalischen Problemen, Lateini­ schen Rechtecken. Als spezielle Ergebnisse seien noch die Fortschritte im "Oberwolfacher Problem" erwähnt sowie die Lösung der seit 1890 offenen Imperium-Vermutung von Heawood. Die Grundidee zu dieser Lösung ist in der abgebildeten Land­ karte mit 19 paarweise benachbarten, aus jeweils 4 ge­ trennten Ländern bestehenden Staaten angedeutet. © - 3 - vortragsauszüge- R. AHARONI: Matchings in infinite graphs A criterion is present~d for a graph· at" any cardinality to passess a perfeet matc~ing. B. ALSPACH: Same new results on. the Oberwolfach problem Let F(11,12, •.• ,lr) IG denate an isomorphi~ factorization of G- into 2-factors each of which is compased of cycles af lengths l1,12, ••• ,lr. If a~l the li'5 are the same value 1, write F(l»)G instead.