Publications - Robert A. Beezer



Refereed Publications

Titles are links to abstracts below. Where available, a link will provide a downloadable version of the paper.

  1. R.A. Beezer. Sylow subgraphs in self-complementary vertex transitive graphs.
    Expositiones Mathematicae, 24, no. 2, (2006), 185-194.
  2. R.A. Beezer. The girth of a design.
    Journal of Combinatorial Mathematics and Combinatorial Computing, 40, (2002), 97-113.
  3. R.A. Beezer. Counting configurations in designs.
    Journal of Combinatorial Theory, Series A, 96, no. 2, (2001), 341-357.
  4. R.A. Beezer, J. Riegsecker and B. Smith. Using minimum degree to bound average distance.
    Discrete Mathematics, 226, (2001) 365-371.
  5. R.A. Beezer and E.J. Farrell. The matching polynomial of a distance-regular graph.
    International Journal of Mathematics and Mathematical Sciences, 23, no. 2, (2000), 123-131.
  6. R.A. Beezer and E.J. Farrell. Counting subgraphs of a regular graph.
    Journal of Mathematical Sciences, 9, no. 1 (1998) 47-55.
  7. R.A. Beezer, E.J. Farrell, J. Riegsecker and B. Smith. Graphs with a minimum number of pairs of independent edges I: Matching polynomials.
    Bulletin of the Institute of Combinatorics and Its Applications, 18 (1996) 17-32.
  8. R.A. Beezer. Closing in on the internal rate of return.
    UMAP Journal, 17, no. 2 (1996). Reprinted in Tools for Teaching 1996, 47--78. COMAP, Inc. Lexington, Mass. 1997.
  9. R.A. Beezer and E. J. Farrell. The matching polynomial of a regular graph.
    Discrete Mathematics, 137 (1995) 7-18.
  10. R.A. Beezer and J. Riegsecker. Catalogs of regular graphs.
    International Journal of Computer Mathematics, 51 (1994) 1-5. [PostScript]
  11. R.A. Beezer. The number of subgraphs of a regular graph.
    Congressus Numerantium, 100 (1994) 89-96.
  12. R.A. Beezer. Trees with very few eigenvalues.
    Journal of Graph Theory, 14, no. 4 (1990) 509-517.
  13. R.A. Beezer. A disrespectful polynomial.
    Linear Algebra and Its Applications, 128 (1990) 139-146.
  14. R.A. Beezer. Orbit polynomial graphs of prime order.
    Discrete Mathematics, 67 (1987) 139-147.
  15. R.A. Beezer. Trivalent orbit polynomial graphs.
    Linear Algebra and Its Applications, 73 (1986) 133-146.
  16. R.A. Beezer. On the polynomial of a path.
    Linear Algebra and Its Applications, 63 (1984) 221-225.


Technical Reports, Conference Proceedings and Manuscripts

  1. R.A. Beezer. Combinatorial object library. University of Puget Sound Department of Mathematics and Computer Science Technical Report 93-1, August 1993.
  2. R.A. Beezer. Generating catalogs of regular graphs. University of Puget Sound Department of Mathematics and Computer Science Technical Report 91-1, August 1991.
  3. R.A. Beezer, G.M. Constantine and E.J. Farrell. A graph polynomial package. University of the West Indies, St. Augustine, Mathematical Report 05-01-91, June 1991.
  4. R.A. Beezer. Distance polynomial graphs. Proceedings of the Sixth Caribbean Conference on Combinatorics and Computing, University of the West Indies, St. Augustine, Trinidad, January, 1991.
  5. R.A. Beezer, J. Riegsecker and B. Smith. On conjectures of Graffiti concerning regular graphs. University of Puget Sound Department of Mathematics and Computer Science Technical Report 89-1, August 1989.
  6. R.A. Beezer, Polynomials of the adjacency matrix of a graph. Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1984.


Book Reviews

  1. Assignment Problems, by Rainer Burkard, Mauro Dell'Amico, Silvano Martello. In press.
  2. Pearls of Discrete Mathematics, by Martin Erickson. In press.
  3. Sage (Version 3.4), Featured Review. SIAM Review, 51, No. 4 (2009). [Preprint]
  4. Vector Calculus, by Michael Corral. To appear. [Preprint]
  5. Graph Theory, by J.A. Bondy and U.S.R. Murty. SIAM Review, 50, No. 3 (2008) [Preprint]
  6. The Art of Mathematics: Coffee Time in Memphis, by Bela Bollobas. SIAM Review, 50, No. 1 (2008) [Preprint]
  7. A Java Library of Graph Algorithms and Optimization, by Lau, Hang T. SIAM Review, 49, No. 3 (2007) [Preprint]
  8. Handbook of Graph Theory, by Jonathan L. Gross and Jay Yellen. SIAM Review, 48, No. 1 (2006) [Preprint]
  9. Combinatorics of Permutations, by Miklos Bona. SIAM Review, 47, No. 2 (2005) [Preprint]
  10. Proofs That Really Count: The Art of Combinatorial Proof, by Arthur T. Benjamin and Jennifer J. Quinn SIAM Review, 46, No. 3 (2004) [Preprint]
  11. Discrete Mathematics, by Laszlo Lovasz, Jozef Pelikan, Katalin K. Vesztergombi. SIAM Review, 45, No. 4 (2003) [Preprint]
  12. Discrete Mathematics Using Latin Squares, by Charles F. Laywine, Gary L. Mullen. SIAM Review, 44, No. 4 (2002) [Preprint]
  13. Combinatorics and Graph Theory, by John M. Harris, Jeffry L. Hirst and Michael J. Mossinghoff. SIAM Review, 43, No. 4 (2001) [Preprint]
  14. Erdos on Graphs: His Legacy of Unsolved Problems, by Fan Chung and Ron Graham. SIAM Review, 42, No. 1 (2000) [Preprint]
  15. Modern Graph Theory, by Bela Bollabas. SIAM Review, 41, No. 2 (1999) [Preprint]
  16. Graph Theory, by Reinhard Diestel. SIAM Review, 41, No. 2 (1999) [Preprint]
  17. Eigenspaces of Graphs, by D. Cvetkovic, P. Rowlinson and S. Simic. SIAM Review, 40, No. 4 (1998) [Preprint]


Mathematical Reviews

If you have electronic access to Mathematical Reviews (MathSciNet) you can view the list of articles I have reviewed together with the reviews themselves. Or consult a compendium of the seventy-seven reviews I've written. (Current as of August 2009.)



Abstracts

Rob Beezer, beezer@ups.edu, Updated: August 26, 2009, Created: Nov 15, 1994