Publications

1.  Wayne Barrett, Shaun Fallat, Veronika Furst, Shahla Nasserasr, Brendan Rooney, Michael Tait, Graphs with Bipartite Complement that Admit Two Distinct Eigenvalues, Electronic Journal of Linear Algebra, Submitted, 2025, https://arxiv.org/abs/2411.12917

2. Shaun M. Fallat, H. Tracy Hall, Rupert H. Levene, Seth A. Meyer, Shahla Nasserasr, Polona Oblak, Helena Smigoc, Spectral arbitrariness for trees fails spectacularly, Accepted. Journal of Combinatorial Theory, Series B, 2024.

3.  Cheryl Grood, Ruth Haas, Bonnie Jacob, Erika King, Shahla Nasserasr, Well-forced graphs. Graphs and Combinatorics, 40, 129 (2024), https://doi.org/10.1007/s00373-024-02827-z 

4. M. Edwards, G. MacGillivray, S. Nasserasr, Strongly i-bicritical graphs, Theory and Applications of Graphs, Vol. 11: Iss. 1, Article 2. (2024), https://digitalcommons.georgiasouthern.edu/tag/vol11/iss1/2/

5. Shaun Fallat, Neha Joshi, Roghayeh Maleki, Karen Meagher, Seyed Ahmad Mojallal, Shahla Nasserasr, Mahsa N. Shirazi, Andriaherimanana Sarobidy Razafimahatratra and Brett Stevens, The q-Analogue of Zero Forcing for Certain Families of Graphs. Discrete Applied Mathematics, 348 (2024), 91–104. https://doi.org/10.1016/j.dam.2024.01.014 

6. Sarah Allred, Emelie Curl, Shaun Fallat, Shahla Nasserasr, Houston Schuerger, Ralihe R. Villagrán, Prateek K. Vishwakarma, The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions. Graphs and Combinatorics, 40, 20 (2024). https://doi.org/10.1007/s00373-023-02745-6

7. Wayne Barrett, Shaun Fallat, Veronika Furst, Shahla Nasserasr, Brendan Rooney, Michael Tait, Regular Graphs of Degree at Most Four that Allow Two Distinct Eigenvalues. Linear Algebra and Its Applications, 679 (2023), 127–164. https://doi.org/10.1016/j.laa.2023.09.012

8. G. MacGillivray, S. Nasserasr, F. Yang, Colourings of (m, n)-coloured mixed graphs, Accepted. Discrete Mathematics & Theoretical Computer Science, 2023. https://arxiv.org/abs/2010.09091

9. Wayne Barrett, Shaun Fallat, Veronika Furst, Franklin Kenter, Shahla Nasserasr, Brendan Rooney, Michael Tait, Hein van der Holst, Sparsity of Graphs that Allow Two Distinct Eigenvalues,  Linear Algebra and Its Applications, 674, (2023), pp. 377 -- 395. https://doi.org/10.1016/j.laa.2023.06.004 

10. M. Adm, K. Almuhtaseb, S. Fallat, K. Meagher, S. Nasserasr, M. N. Shirazi, A. S. Razafimahatratra, Weakly Hadamard Diagonalizable Graphs. Linear Algebra and Its Applications, 610, (2021), pp. 86 -- 119. https://doi.org/10.1016/j.laa.2020.09.038 

11. A. Chan, S. Fallat, S. Kirkland, J. C.-H. Lin, S. Nasserasr, S. Plosker,  Complex Hadamard Diagonalisable Graphs, Linear Algebra and its Applications,  605 (2020) pp. 158 -- 179. https://doi.org/10.1016/j.laa.2020.07.018 

12. M. Adm, S. Fallat, K. Meagher, S. Nasserasr, S. Plosker, B. Yang, Achievable Multiplicity partitions in the inverse eigenvalue problem of a graph, Special Matrices,  7 (2019) pp. 276 -- 290. https://doi.org/10.1515/spma-2019-0022 

13. D. Ferrero, M. Flagg, H. T. Hall, L. Hogben, J. C.-H. Lin, S. A. Meyer, S. Nasserasr, B. Shader, Rigid linkages and partial zero forcing, The Electronic Journal of Combinatorics, 26 (2) (2019), P2.43 https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i2p43

14.  M. Edwards, A. Finbow, G. MacGillivray, S. Nasserasr, Independent Domination Bicritical Graphs, Australasian Journal of Combinatorics, 72 (2018), pp. 446 -- 471. 

http://ajc.maths.uq.edu.au/?page=get\_volumes\&volume=72

15.  M. Edwards, G. MacGillivray, S. Nasserasr, Reconfiguring minimum dominating sets: the gamma-graph of a tree, Discussiones Mathematicae Graph Theory, 38 (3) (2018), pp. 703 -- 716. https://doi.org/10.7151/dmgt.2044

16. G. MacGillivray, L. Morrison and C. M. Mynhardt, S. Nasserasr,\ Integer solutions to x^2 + y^2 = z^2 - k for a fixed integer k,  Involve!, 10 (2017), pp. 881 -- 892. http://msp.org/involve/2017/10-5/p10.xhtml

17. 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.

18. 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

19. 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.

20.  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.

21. 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), pp. 2064 -- 2076.

22. D. Hoff, C. R. Johnson, S. Nasserasr, TPk Completion Problem for Shapes, Linear Algebra and its Applications, 436 (2012), pp. 4412 -- 4422.

23.  C. R. Johnson, and S. Nasserasr, TP2 = Bruhat, Discrete Mathematics, 310 (2010), pp. 1627 -- 1628.

24.  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) pp.  1740 -- 1752.

Book Chapter

1. K. Mynhardt, and S. Nasserasr, Reconfiguration of Colourings and Dominating Sets in Graphs, Survey Chapter of the book, The 50th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, CRC Press, 2020.