Jason J. Molitierno, Ph.D.

Education: Ph.D, University of Connecticut (2001); MS, University of Connecticut (1999); BA, Connecticut College (1996).

Research Interests: Matrix Theory and its Applications to Graph Theory.

Courses Usually Taught : Modern College Mathematics I, Calculus for Decision Making, Statistics for Decision Making, Precalculus, Calculus I, Calculus II, Calculus III, Linear Algebra, Differential Equations, Real Analysis, Graph Theory

Biography: Dr. Jason Molitierno has been an Assistant Professor of Mathematics at Sacred Heart University since 2001. Before coming to Sacred Heart University, he was a teaching assistant at the University of Connecticut where he won a variety of awards for his teaching. Prior to attending the University of Connecticut, Dr. Molitierno taught seventh grade at Bennie Dover Jackson Middle School in New London, CT and obtained a teaching certificate through the State of Connecticut. Dr. Molitierno is also very active in the Mathematical Association of America and acts as the department liaison. He has organized various events through the MAA and has enabled Sacred Heart University to host the annual Fall meeting in 2006.

Publications:

Book:

• ”Applications of Combinatorial Matrix Theory to Laplacian Matrices of Graphs”, CRC Press - Taylor & Francis; Boca Raton, FL; 2012.

Articles:

• ”The spectral radius of submatrices of Laplacian matrices for graphs with cut vertices”,

Linear Algebra and its Applications, 428: 1987–1999, 2008.

• ”On the algebraic connectivity of graphs as a function of genus”, Linear Algebra and

its Applications, 419: 519–531, 2006.

• ”The spectral radius of submatrices of Laplacian matrices for trees and its application to

the Fiedler Vector”, Linear Algebra and its Applications, 406: 253–271, 2005.

• (with S. Fallat, S. Kirkland, and M. Neumann) ”Graphs which are Laplacian Integral”,

Journal of Graph Theory, Vol. 50, Issue 2: 162–174, 2005. (I was the corresponding author.)

• (with M. Neumann) ”On operations involving adding vertices to tree-like graphs”, Linear

and Multilinear Algebra, 52:145-156, 2004.

• (with M. Neumann) ”On trees with perfect matchings”, Linear Algebra and Applications,

362:75-85, 2003.

• (with S. J. Kirkland, M. Neumann, and B. L. Shader) “On graphs with equal algebraic

and vertex connectivity”, Linear Algebra and Applications, 341:45-56, 2002.

• (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:237–46, 2001.

• (with M. Neumann) “The algebraic connectivity of two trees connected by an edge of

infinite weight”, ELA (Electronic Linear Algebra journal), 8:1–13, 2001.

• (with M. Neumann and B. L. Shader) “Tight bounds on the algebraic connectivity of

a balanced binary tree”, ELA (Electronic Linear Algebra journal), 6:62–71, 2000.

Contact :
Academic Building, SC 220G
Ph: (203) 371-7775
Fax: (203) 396-8019
Email: MolitiernoJ@sacredheart.edu
Website: http://faculty.sacredheart.edu/molitiernoj

Previous Page    Back to Faculty and Staff    Next Page