Jason J. Molitierno, PhD

Assistant Professor of Mathematics

Mathematics Department	Office: SC-207F
Sacred Heart University	Phone: (203) 396-8324
5151 Park Avenue	Email: molitiernoj@sacredheart.edu
Fairfield, CT 06825-1000

For a detailed Curriculum Vitae, click here.

Teaching

Spring 2006
- Courses:
  - MA 133, Business Statistics
  - MA 354, Differential Equations

Research

Research Interests: Matrix Theory and its applications to Graph Theory
Ph.D. Dissertation: Coefficient of ergodicity type bounds for the algebraic connectivity of graphs, University of Connecticut, 2001. advisor: Dr. Michael Neumann.
Publications:
- "On the algebraic connectivity of graphs as a function of genus", submitted to Linear Algebra and its Applications. (2006).
- "The spectral radius of submatrices of the Laplacian matrix for a tree and its application to the Fiedler vector", Linear Algebra Appl., 406 (2005), 253-271.
- (with S. Fallat, S. J. Kirkland, and M. Neumann) "Graphs which are Laplacian Integral", J. Graph Theory. Vol. 50, Issue 2 (2005), 162-174.
- (with M. Neumann) "On operations involving adding vertices to tree-like graphs", Linear and Multilinear Algebra, 52 (2004), 145-156.
- (with M. Neumann) "On trees with perfect matchings", Linear Algebra Appl., 362 (2003), 75-85.
- (with S. J. Kirkland, M. Neumann, and B. L. Shader) "On graphs with equal algebraic and vertex connectivity", Linear Algebra Appl., 341 (2002), 45-56.
- (with S. J. Kirkland, and M. Neumann) "The sharpness of a lower bound on the algebraic connectivity for maximal graphs", Linear and Multilinear Algebra, 48 (2001), 237-246.
- (with M. Neumann) "The algebraic connectivity of two trees connected by and edge of infinite weight", Electronic Linear Algebra J., 8 (2001), 1-13.
- (with M. Neumann and B. L. Shader) "Tight bounds on the algebraic connectivity of a balanced binary tree", Electronic Linear Algebra J., 6 (2000), 62-71.

Useful Math Websites:

last modified January 2, 2006.