3 papers
math.CO2023
Acyclic graphs with at least vertices are -recognizable
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
The -deck of an -vertex graph is the multiset of subgraphs obtained from it by deleting vertices. A family of -vertex graphs is -recognizable if every…
math.CO2023
Trees with at least vertices are -reconstructible
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
The -deck of an -vertex graph is the multiset of (unlabeled) subgraphs obtained from it by deleting vertices. An -vertex graph is -reconstructible if i…
math.CO2016
Graphs with Integer Matching Polynomial Roots
S. Akbari, P. Csikvari, A. Ghafari +2
In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characte…