Mina Nahvi

According to our database, Mina Nahvi authored at least 8 papers between 2016 and 2024.

Collaborative distances:

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

2024

Saturation numbers for Berge cliques.

Sean English, Jürgen Kritschgau, Mina Nahvi, Elizabeth Sprangel

Eur. J. Comb., 2024

2022

The Gapped k-Deck Problem.

Rebecca Golm, Mina Nahvi, Ryan Gabrys, Olgica Milenkovic

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

3-regular graphs are 2-reconstructible.

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin

Eur. J. Comb., 2021

2020

Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices.

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin

Graphs Comb., 2020

Nordhaus-Gaddum and other bounds for the chromatic edge-stability number.

Saieed Akbari, Sandi Klavzar, Nazanin Movarraei, Mina Nahvi

Eur. J. Comb., 2020

Some criteria for a signed graph to have full rank.

Saieed Akbari, A. Ghafari, K. Kazemian, Mina Nahvi

Discret. Math., 2020

2017

Graphs with integer matching polynomial zeros.

Saieed Akbari, Péter Csikvári, A. Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi

Discret. Appl. Math., 2017

2016

Graphs with Integer Matching Polynomial Roots.

Saieed Akbari, Péter Csikvári, A. Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi

CoRR, 2016