Areas of Interest

Courses

Professional Info

Publications

Contact

• Computational graph theory
• Enumeration
• Algebraic graph theory
• Probabilistic combinatorics
• Algorithms and analysis

Fall 2004-- Calculus I
Fall 2004-- Abstract Algebra II

 
Education:
B.S. in Mathematics, Worcester Polytechnic Institute, Worcester, Massachusetts.
Ph.D. and M.S. in Mathematics, Michigan State University, East Lansing, Michigan.

Organizations:
American Mathematical Society
Association for Women in Mathematics
Mathematical Association of America
Society for Industrial and Applied Mathematics, Discrete Mathematics Activity Group
Institute of Combinatorics and its Applications, Fellow.

• The asymptotic number of symmetries in locally-restricted trees, (with J.W. Kennedy, E.M. Palmer and R.W. Robinson), Discrete Applied Mathematics 26, (1990) 121-124.
  
• The expected number of symmetries in locally-restricted trees I, Graph Theory, Combinatorics and Applications (Y. Alavi et al., eds.) Wiley, New York (1991) 849-859.
  
• On signed graphs with prescribed positive and negative subgraphs, (with G. Chartrand, F. Harary and H. Hevia),Vishwa International Journal of Graph Theory 1 (1992) 9-18.
  
• The advantage of the lexicographically maximum level sequence code for caterpillars, (with A. J. Schwenk), Graph Theory, Combinatorics, and Applications (y. Alavi et al., eds.) Wiley, New York (1995) 777-787.
  
• The expected number of symmetries in locally-restricted trees II, Discrete Applied Mathematics 66, (1996)245-253.
  
• Generation of trees with fixed diameter and bounded degree, (with S.A. Carrigan), Combinatorics, Graph Theory and Algorithms (Y. Alavi et al., eds), New Issues Press, Michigan (1999) 161-170