Shahla Nasserasr

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Shaun M. Fallat

> Home > Persons > Shahla Nasserasr

Publications

2024
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/FallatJMMMNSRS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/FallatJMMMNSRS24
Shaun M. Fallat, Neha Joshi, Roghayeh Maleki, Karen Meagher, Seyed Ahmad Mojallal, Shahla Nasserasr, Mahsa N. Shirazi, Andriaherimanana Sarobidy Razafimahatratra, Brett Stevens:
The q-analogue of zero forcing for certain families of graphs. Discret. Appl. Math. 348: 91-104 (2024)
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/gc/AllredCFNSVV24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/AllredCFNSVV24
Sarah Allred, Emelie Curl, Shaun M. Fallat, Shahla Nasserasr, Houston Schuerger, Ralihe R. Villagrán, Prateek K. Vishwakarma:
The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions. Graphs Comb. 40(1): 20 (2024)
[j4]
- view
  authority control:
- export record
  dblp key:
  - journals/jctb/FallatHLMNOS24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jctb/FallatHLMNOS24
Shaun M. Fallat, H. Tracy Hall, Rupert H. Levene, Seth A. Meyer, Shahla Nasserasr, Polona Oblak, Helena Smigoc:
Spectral arbitrariness for trees fails spectacularly. J. Comb. Theory B 169: 161-210 (2024)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.