HEATHER D JORDON

Heather D. Jordon
Department of Mathematics
Illinois State University
Normal, IL 61790-4520
309.438.7838
hjordon@ilstu.edu

Education:

Ph.D., Mathematics (with emphasis on Graph Theory), Western Michigan University (1996). Dissertation: A Graph Theoretic Study of the Similarity of Discrete Structures, Advisor: Gary Chartrand.
M.A. with Honors, Mathematics, Western Michigan University (1992).
B.S. Cum Laude, Mathematics with Honors, Western Michigan University (1990).

Experience:

Professor, Department of Mathematics, Illinois State University, 2010--present.
Associate Professor, Department of Mathematics, Illinois State University, 2005--2010.
Assistant Professor, Department of Mathematics, Illinois State University, 2002--2005.
Assistant Professor, Department of Mathematics and Statistics, University of Vermont, 2001--2002.
Assistant Professor, Department of Mathematics and Statistics, Grand Valley State University, 1996--1997, 1998--2001.
Systems Engineer, Military Systems Department, Smiths Aerospace, 1997--1998.
Instructor, ATYP (Academically Talented Youth Program), January 1996--June 1996.
Doctoral Associate, Western Michigan University, 1995-1996.
Department of Defense AASERT (Augmentation Awards for Science and Engineering Research Training) Graduate Research Fellow, 1992--1995.

Publications:

Alspach's problem: the case of Hamilton cycles and 5-cycles, Electron. J. Combin. 18(1) (2011), #P82.
The maximum size of a partial 3-spread in a finite vector space over GF(2), Designs, Codes, and Cryptography, 54 (2010), 101--107. (with S. El-Zanati, G. Seelinger, P. Sissokho, and L. Spence)
The convex hull of degree sequences of signed graphs. Discrete Math., 309 (2009), 5841--5848. (with R. McBride and S. Tipnis)
On r-labeling up to ten vertex-disjoint C_4x+1, J. Combin. Math. Combin. Comp., 70 (2009), 161--176. (with E. Butzen, S. El-Zanati, A. Modica, and R. Schrishuhn)
Directed cyclic hamiltonian cycle systems of K_n^*. Discrete Math., 309 (2009), 784--796. (with J. Morris)
Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor. Discrete Math., 308 (2008), 2440--2449. (with J. Morris)
Edge-colored cube decompositions. Aequationes Math., 72 (2006), 213--224. (with P. Adams and D. Bryant)
Signed graph factors and degree sequences. J. Graph Theory, 52 (2006), 27--36. (with D.G. Hoffman)

Under Gavlas:
Cycle systems in complete bipartite graphs. Discrete Math. 284 (2004), 37--43. (with D. Archdeacon, M. Debowsky, and J. Dinitz)
Hamilton paths in cartesian products of directed cycles. Graphs Combin. 19 (2003), 459--466. (with D. Austin and D. Witte)
Factorizations of the complete graph into C₅-factors and 1-factors. Graphs Combin. 19 (2003), 289--296. (with P. Adams, D. Bryant, S. El-Zanati)
Skolem-type Difference Sets for Cycle Systems. Electron. J. Combin. 10 (2003), #R38. (with D. Bryant and A. C. H. Ling)
Cycle decompositions IV: complete directed graphs and fixed length directed cycles. J. Combin. Theory Ser. A 103 (2003), 165--208. (with B. Alspach, M. Sajna, and H. Verrall)
Decompositions of the complete graph into small 2-regular graphs. J. Combin. Math. Combin. Comp. 43 (2002), 135--146. (with P. Adams and D. Bryant)
Efficient open domination in graphs. Proceedings of the Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications (Kalamazoo, MI, 2000), eds. Y. Alavi, D. Jones, D.R. Lick, and Jiuqiang Liu, Electron. N. Discrete Math. 11 (2002). (with K. Schultz)
Cycle decompositions of K_n and K_n - I. J. Combin. Theory Ser. B 81 (2001), 77--99. (with B. Alspach)
A new distance measure between graphs. Ars. Combin. 58 (2001), 233--244.
Which Sequences of Iterated Jump Graphs are Planar? Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999) Congress. Numer. 139 (1999), 33--39. (with G. Chartrand, D.W. VanderJagt, and P. Zhang)
Automorphism groups with cyclic commutator subgroup and Hamilton cycles. Discrete Math. 189 (1998), 69--78.(with E. Dobson, J. Morris, and D. Witte)
H-distance graphs. Proceedings of the Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications (Kalamazoo, MI, 1996), eds. Y. Alavi, D. Lick, and A.J. Schwenk, I (1998), 423--433.
Near-automorphisms of graphs. Proceedings of the Eighth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications (Kalamazoo, MI, 1996), eds. Y. Alavi, D. Lick and A.J. Schwenk, I (1998), 181--192. (with G. Chartrand and D. VanderJagt)
Indiana Jones and the quest for anticonnected digraphs. Pi Mu Epsilon. J. 10(6) (1997), 443--457. (with N. Sousanis and K. Stauffer)
Rotation and jump distances between graphs. Discussion Math.-Graph Theory 17(2) (1997), 285--300. (with G. Chartrand, H. Hevia, and M. A. Johnson) (abstract)
Anticonnected digraphs. Utilitas Math. 51 (1997), 41--54. (with G. Chartrand, M. Schultz, and C. E. Wall)
The forcing domination number of a graph. J. Combin. Math. Combin. Comp. 25 (1997), 161--174. (with G. Chartrand, F. Harary, and R. C. Vandell)
Stratidistance in stratified graphs. Math. Bohemica 122 (1997), 337--347. (with G. Chartrand, M. A. Henning, and R. Rashidi) (abstract)
Greatest common distance-preserving subgraphs. Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997). Congress. Numer. 124 (1997), 47--64.
On strong digraphs with a prescribed ultracenter. Czech. Math. J. 47 (1997), 83--94. (with G. Chartrand, K. Schultz, and S. J. Winters) (abstract)
Convergent sequences of iterated H-line graphs. Discrete Math. 147 (1995), 73--86. (with G. Chartrand and M. Schultz)
Efficient open domination in graphs. Sci. Ser. A Math. Sci. N.S. 6 (1994/00) 77--84. (with K. Schultz and P. Slater)
On signed degrees of a signed graph. Czech. Math. J. 44 (1994), 677--690. (with G. Chartrand, F. Harary, and M. Schultz)
H-Distance in graphs. Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994) Congress. Numer. 101 (1994), 3--15. (with G. Chartrand and M. Schultz)
On graphs and their frames. Vishwa Internat. J. of Graph Theory 1 (1992), 111--131. (with M. A. Henning and M. Schultz)
Framed! A graph embedding problem. Bull. of the Inst. of Combin. and Its Appl. 4 (1992), 35--50. (with G. Chartrand and M. Schultz)

Invited Talks:

Some open problems in graph decompositions, symposium talk at MIGHTY LI, Indiana University-Purdue University Fort Wayne, April 2011.
Skolem-type Difference Sets for Cycle Systems, colloquium talk at the University of Vermont, April 2002; presented at the Special Session on Graph Labeling, Graph Coloring, and Topological Graph Theory at the AMS Fall Central Section Meeting, Western Michigan University, October 2008; plenary talk at the Fields Institute Discrete Mathematics Days 2009, University of Ottawa, May 2009, presented to the NSF sponsored Research Experiences for Undergraduates at Illinois State University, July 2009.
Partitioning the Integers into Difference Tuples, presented to the NSF sponsored Research Experiences for Undergraduates at Illinois State University, July 2007.
Signed Graph Factors and Degree Sequences, presented at the Special Session on Graph Theory at AMS Fall Central Section Meeting, University of Nebraska-Lincoln, October 2005.
Cyclic Hamiltonian Cycle Systems of the Complete Graph Minus a 1-Factor, presented at the Conference in Honor of Joan P. Hutchinson on the Occasion of her Sixtieth Birthday, University of Colorado at Denver, May 2005.
Edge-Colored Cube Decompositions, presented at the Discrete Mathematics Seminar, Auburn University, March 2004.
Cycle Systems in the Complete Bipartite Graph Minus a One-Factor, presented at the workshop on Combinatorial Design Theory, DIMACS Connect Institute '03 Graph Theory and its Applications to Problems of Society, Rutgers, The State University of New Jersey, July 2003.
Cycle Systems of the Complete Symmetric Digraph, colloquium talk at the University of Queensland, January 2003.
Hamiltonian Paths in Cartesian Powers of Directed Cycles, presented at the Thirteenth Australasian Workshop on Combinatorial Algorithms, University of Queensland, June 2002.
Cycle Decompositions of Complete Graphs and Near Complete Graphs, presented at the Workshop on Discrete Mathematics: Applications and Education, University of Queensland, June 2001.
Directed Cycle Decompositions of the Complete Symmetric Digraph, Part I, presented at the Special Session on Graphs and Digraphs at the AMS Southwestern Sectional Meeting, University of Nevada-Las Vegas, April 2001.
Decomposing Graphs, presented at the Pi Mu Epsilon and Kalamazoo Area Student Chapter of the MAA Monthly Meeting, Western Michigan University, March 2001.
Decompositions of Graphs, presented to the NSF sponsored Research Experiences for Undergraduates at Grand Valley State University, July 2000.
Cycle Decompositions of K_n and K_n - I, presented at the AMS Southwestern Sectional Meeting, University of Nevada-Las Vegas, April 1999; the workshop on Graph Partitions, DIMACS Connect Institute '00 Graph Theory and its Applications to Problems of Society, Rutgers, The State University of New Jersey, July 2000; the Graph Theory and Combinatorics Seminar at University of Illinois, Urbana-Champagne, October 2000; and the Discrete Mathematics Seminar at Illinois State University, October 2000.
An Extension of Steiner Triple Systems, colloquium talk at Western Michigan University, November 1998.
A Mathematician in Industry, presented to the GVSU Mathematics & Statistics Club, Grand Valley State University, November 1997.
Common Substructures of and Metrics Defined on Graphs. What's New?, seminar talk presented at Simon Fraser University, August 1996.
A Metric for Graphs, presented in the Special Sessions for Graduate Student Research at the Seattle Mathfest, University of Washington, August 1996.
Framed!, presented at the Pi Mu Epsilon and Kalamazoo Area Student Chapter of the MAA Monthly Meeting, Western Michigan University, November 1991.

Contributed Talks:

Alpsach's Problem: The Case of Hamilton Cycles and 5-cycles, presented at MIGHTY L, University of Wisconsin-Superior, October 2010.
Applications of Graph Theory in DNA Sequencing by Hybridization and Library Screening, presented at the Biology/Mathematics Research Workshop, Illinois State University, November 2004.
Skolem-type Difference Sets for Cycle Systems, presented at the 16th Mid-West Conference on Combinatorics, Cryptography & Computing, Southern Illinois University, Carbondale, October 2002 and at the 2003 Big Sky Conference on Discrete Mathematics, The University of Montana at Missoula, September 2003.
Hamiltonian Paths in Cartesian Powers of Directed Cycles, presented at the 15th Mid-West Conference on Combinatorics, Cryptography & Computing, University of Nevada--Las Vegas, October 2001.
Decomposing the Complete Graph into Small 2-Regular Graphs, presented at the 32nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, February 2001.
Cycle Decompositions of K_n^*, presented at the 2000 Big Sky Conference on Discrete Mathematics, The University of Montana at Missoula, September 2000; MIGHTY XXXIII, Wright State University, October 2000.
Cycle Decompositions of K_n and K_n- I, presented at the Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, Western Michigan University, June 2000.
A Transformation of Graphs, presented at MIGHTY XXXII, Indiana-Purdue University-Fort Wayne, October 1999.
A Mathematician in Industry, presented to the GVSU Mathematics & Statistics Club, Grand Valley State University, November 1997.
A Common Subgraph of Two Graphs, presented at the 28th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, March 1997.
Near-Automorphisms of Graphs, presented at the Joint Mathematics Meetings, San Diego, January 1997.
H-Distance in Graphs, presented at the Eighth International Conference on Graph Theory, Combinatorics, Algorithms, and Applications, June 1996.
H-Connected Graphs, presented at the 27th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Louisiana State University, February 1996.
Greatest Common Distance-Preserving Graphs, presented at the Joint Mathematics Meetings, Orlando, January 1996.
Stratidistance in Stratified Graphs, presented at MIGHTY XXV, Illinois State University, September 1995.
Signed Degrees in Signed Graphs, presented at the Burlington Mathfest, University of Vermont, August 1995.
Anticonnected Digraphs, presented at the 26th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, March 1995.
Efficient Open Domination in Graphs, presented at the Joint Mathematics Meetings, San Francisco, January 1995.
On Strong digraphs with a Prescribed Ultracenter, presented at MIGHTY XXII, Saginaw Valley State University, May 1994.
H-Distance in Graphs, presented at the 25th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Florida Atlantic University, March 1994.
Exact 1-Step Domination, presented at MIGHTY XXI, Ball State University, October 1993.
Convergent Sequences of Iterated H-Line Graphs, presented at 6th Cumberland Conference on Graph Theory and Computing, Rhodes College, Memphis, May 1993.
Frames of Graphs, presented at MIGHTY (MIdwest GrapH TheorY) XVII, Grand Valley State University, March 1991.

Grants, Honors, and Awards:

The Institute of Combinatorics and its Applications 2006 Hall Medal
College of Arts and Sciences Outstanding Teacher Award, $500, 2005
Illinois State University Pre-Tenure Faculty Initiatives Grant, $2500, 2005--2006
Illinois State University New Faculty Initiatives Grant, $2500, 2003--2004
University of Queensland Visiting Scholar, December 2002--January 2003
NSF--AWM Mentoring Travel Grant, $3800, February 2001
NSF--AWM Travel Grant, $300, March 1997
Exxon Education Foundation Travel Grant, $500, 1996
Project NExT Fellowship, 1996--1997
Department Graduate Research Scholars Award, Western Michigan University, 1996
Doctoral Associateship, Western Michigan University, 1995--1996
Charles H. Butler Excellence in Teaching Award, 1995
Department of Defense AASERT Graduate Research Fellowship, 1992--1995
Office of Naval Research Assistantship, 1992
Undergraduate Research and Creative Activities Award, $1200, 1990

Courses Taught:

Home