Follow
Mina Nahvi
Title
Cited by
Cited by
Year
Nordhaus–Gaddum and other bounds for the chromatic edge-stability number
S Akbari, S Klavžar, N Movarraei, M Nahvi
European Journal of Combinatorics 84, 103042, 2020
142020
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices
AV Kostochka, M Nahvi, DB West, D Zirlin
Graphs and Combinatorics 36 (3), 491-501, 2020
132020
3-regular graphs are 2-reconstructible
AV Kostochka, M Nahvi, DB West, D Zirlin
European Journal of Combinatorics 91, 103216, 2021
112021
Graphs with integer matching polynomial zeros
S Akbari, P Csikvári, A Ghafari, SK Ghezelahmad, M Nahvi
Discrete Applied Mathematics 224, 1-8, 2017
112017
Acyclic graphs with at least 2ℓ+ 1 vertices are ℓ‐recognizable
AV Kostochka, M Nahvi, DB West, D Zirlin
Journal of Graph Theory, 2023
52023
Mixed paths and cycles determined by their spectrum
S Akbari, A Ghafari, M Nahvi, MA Nematollahi
Linear Algebra and its Applications 586, 325-346, 2020
42020
The gapped k-deck problem
R Golm, M Nahvi, R Gabrys, O Milenkovic
2022 IEEE International Symposium on Information Theory (ISIT), 49-54, 2022
32022
Some criteria for a signed graph to have full rank
S Akbari, A Ghafari, K Kazemian, M Nahvi
Discrete Mathematics 343 (8), 111910, 2020
32020
On sizes of 1-cross intersecting set pair systems
AV Kostochka, G McCourt, M Nahvi
Siberian Mathematical Journal 62 (5), 842-849, 2021
12021
Saturation numbers for Berge cliques
S English, J Kritschgau, M Nahvi, E Sprangel
European Journal of Combinatorics 118, 103911, 2024
2024
Trees with at least vertices are -reconstructible
AV Kostochka, M Nahvi, DB West, D Zirlin
arXiv preprint arXiv:2307.10035, 2023
2023
Looking Within and Reaching Out: Outreach, Friendship, and Community in the University of Illinois at Urbana-Champaign AWM Student Chapter
G Jaffe, M Nahvi
Fifty Years of Women in Mathematics: Reminiscences, History, and Visions for …, 2022
2022
-reconstructibility of rooted trees
AV Kostochka, M Nahvi, DB West, D Zirlin
Pure and Applied Mathematics Quarterly 18 (6), 2479-2509, 2022
2022
Reconstruction of n-vertex trees from the set of (5n-11)/6-vertex induced subgraphs
A Kostochka, M Nahvi, DB West, D Zirlin
2024 Spring Southeastern Sectional Meeting, 0
Trees with at least 6l+11 vertices are l-reconstructible
M Nahvi, A Kostochka, DB West, D Zirlin
2024 Joint Mathematics Meetings (JMM 2024), 0
The system can't perform the operation now. Try again later.
Articles 1–15