Top of Page Skip to main content

Shahla Nasserasr, Ph.D.

Assistant Professor
Dept. of Mathematics
(954) 262-7973 snasserasr@nova.edu

Education:

Ph.D. Mathematics, College of William and Mary (2010)

Research Interest(s):

  • Discrete Mathematics
  • Matrix Analysis

Courses Taught:

  • Calculus
  • Applied Statistics
  • Trigonometry

My main research interests are in the areas of matrix theory and combinatorics. My recent and current research projects include totally positive matrices and the spectral properties of various matrices associated to graphs.

1. V. Akin, C. R. Johnson, and S. Nasserasr, TPk completion of patterns with one unspecified entry, Electronic Journal of Linear Algebra, 27 (2014), pp. 426–443.
2. C. R. Johnson, and S. Nasserasr, Complete Solution to the TP2 Completion Problem, Linear and Multilinear Algebra, 62 (2014), pp. 1403-1420. http://dx.doi.org/10.1080/03081087.2013.831093
3. B. Ahmadi, F. Alinaghipour, M. Cavers, S. Fallat, K. Meagher, and S. Nasserasr, Minimum number of distinct eigenvalues of graphs, Electronic Journal of Linear Algebra, 26 (2013), pp. 673-691.
4. S. M. Fallat, and S. Nasserasr, On the Null Space Structure Associated with Trees and Cycles, Journal of Combinatorial Mathematics and Combinatorial Computing, 85 (2013), pp. 253-272.
5. B. Ahmadi, F. Alinaghipour, S. Fallat, Y. Fan, K. Meagher, and S. Nasserasr, The minimum rank of universal adjacency matrices, Linear Algebra and its Applications, 437 (2012), 2064–2076.
6. D. Hoff, C. R. Johnson, S. Nasserasr, TPk completion Problem for Shapes, Linear Algebra and its Applications, 436 (2012), 4412–4422.
7. C. R. Johnson, and S. Nasserasr, TP2=Bruhat, Discrete Mathematics, 310 (2010), 1627– 1628.
8. G. MacGillivray, S. Nasserasr, D. D. Olesky and P. van den Driessche, Primitive Digraphs with Smallest Large Exponent, Linear Algebra and Its Applications, 428 (2008) 1740–1752.
Return to top of page