Shahla Nasserasr

According to our database, Shahla Nasserasr authored at least 7 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Well-Forced Graphs.

Cheryl Grood, Ruth Haas, Bonnie C. Jacob, Erika L. C. King, Shahla Nasserasr

Graphs Comb., December, 2024

The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions.

Sarah Allred, Emelie Curl, Shaun M. Fallat, Shahla Nasserasr, Houston Schuerger, Ralihe R. Villagrán, Prateek K. Vishwakarma

Graphs Comb., February, 2024

Spectral arbitrariness for trees fails spectacularly.

Shaun M. Fallat, H. Tracy Hall, Rupert H. Levene, Seth A. Meyer, Shahla Nasserasr, Polona Oblak, Helena Smigoc

J. Comb. Theory B, 2024

The q-analogue of zero forcing for certain families of graphs.

Shaun M. Fallat, Neha Joshi, Roghayeh Maleki, Karen Meagher, Seyed Ahmad Mojallal, Shahla Nasserasr, Mahsa N. Shirazi, Andriaherimanana Sarobidy Razafimahatratra, Brett Stevens

Discret. Appl. Math., 2024

2023

Colourings of (m, n)-coloured mixed graphs.

Gary MacGillivray, Shahla Nasserasr, Feiran Yang

Discret. Math. Theor. Comput. Sci., 2023

2019

Rigid Linkages and Partial Zero Forcing.

Daniela Ferrero, Mary Flagg, H. Tracy Hall, Leslie Hogben, Jephian C.-H. Lin, Seth A. Meyer, Shahla Nasserasr, Bryan L. Shader

Electron. J. Comb., 2019

2018

Reconfiguring minimum dominating sets: the <i>?</i>-graph of a tree.

Michelle Edwards, Gary MacGillivray, Shahla Nasserasr

Discuss. Math. Graph Theory, 2018