Graphs with Integer Matching Polynomial Roots. - Saieed Akbari; Péter Csikvári; A. Ghafari; S. Khalashi Ghezelahmad; Mina Nahvi (CoRR, 2016)

Graphs with integer matching polynomial zeros. - Saieed Akbari; Péter Csikvári; A. Ghafari; S. Khalashi Ghezelahmad; Mina Nahvi (Discret. Appl. Math., 2017)

Some criteria for a signed graph to have full rank. - Saieed Akbari; A. Ghafari; K. Kazemian; Mina Nahvi (Discret. Math., 2020)

Nordhaus-Gaddum and other bounds for the chromatic edge-stability number. - Saieed Akbari; Sandi Klavzar; Nazanin Movarraei; Mina Nahvi (Eur. J. Comb., 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)

3-regular graphs are 2-reconstructible. - Alexandr V. Kostochka; Mina Nahvi; Douglas B. West; Dara Zirlin (Eur. J. Comb., 2021)

The Gapped k-Deck Problem. - Rebecca Golm; Mina Nahvi; Ryan Gabrys; Olgica Milenkovic (ISIT, 2022)

Saturation numbers for Berge cliques. - Sean English; Jürgen Kritschgau; Mina Nahvi; Elizabeth Sprangel (Eur. J. Comb., 2024)