M. Nahvi

activity

20162023

2 ℓ + 1

vertices are

ℓ

-recognizable

2 citations · 2 across the 9 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

3-Regular Graphs Are 2-Reconstructible

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1

A graph is $ℓ$ -reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting $ℓ$ vertices. We prove that $3$ -regular graphs are $2$ -reconstruc…

math.CO2019

Degree lists and connectedness are $3$ -reconstructible for graphs with at least seven vertices

Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1

The $k$ -deck of a graph is the multiset of its subgraphs induced by $k$ vertices. A graph or graph property is $l$ -reconstructible if it is determined by the deck of subgraphs obta…

3-Regular Graphs Are 2-Reconstructible

Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices

Degree lists and connectedness are $3$ -reconstructible for graphs with at least seven vertices