2 citations · 2 across the 9 of their papers we have counts for
11 papers
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…
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…
Saturation Numbers for Berge Cliques
Sean English, Jürgen Kritschgau, Mina Nahvi +1
Let be a graph and be a hypergraph, both embedded on the same vertex set. We say is a Berge- if there exists a bijection $ϕ:E(F)\to E(\mathcal{H}…
The Gapped -Deck Problem
Jonas Golm, Mina Nahvi, Ryan Gabrys +1
The -deck problem is concerned with finding the smallest positive integer such that there exist at least two strings of length that share the same -deck, i.e.,…
On sizes of 1-cross intersecting set pair systems
Alexandr V. Kostochka, Grace McCourt, Mina Nahvi
Let be a set pair system. Füredi, Gyárfás and Király called it {\em -cross intersecting} if is when and if . They…
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…
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 -regular graphs are -reconstruc…
Degree lists and connectedness are -reconstructible for graphs with at least seven vertices
Alexandr V. Kostochka, Mina Nahvi, Douglas B. West +1
The -deck of a graph is the multiset of its subgraphs induced by vertices. A graph or graph property is -reconstructible if it is determined by the deck of subgraphs obta…
Some Mixed Graphs Determined by Their Spectrum
S. Akbari, A. Ghafari, M. Nahvi +1
A mixed graph is obtained from a graph by orienting some of its edges. The Hermitian adjacency matrix of a mixed graph with the vertex set , is the mat…
Some Criteria for a Signed Graph to Have Full Rank
S. Akbari, A. Ghafari, K. Kazemian +1
A weighted graph consists of a simple graph with a weight , which is a mapping,: . A signed graph is a graph whose edges a…
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…