Maximum-nullity and zero-forcing equality for circulant graphs

About 7 years old · traced to

Let kk be a positive integer and let [... ELLIPSIZATION...]rname{Circ}[(\ell^2-1)k,\{1,\ell\}])=2\ell. \] and field independent minimum rank with universally optimal matrix A(G)A(G).

References

Primary source

Derek Young, “Techniques for determining equality of the maximum nullity and the zero forcing number of a graph”, arXiv:1912.07302 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.