Field-independent minimum rank for extended cube graphs
Statement
Let be an integer satisfying , and let be an integer with . The extended cube graphs are denoted by . Extended-cube conjecture. These graphs have field-independent minimum rank, and their adjacency matrices are universally optimal. This conjecture is proposed as a possible characterization of the extended cube graphs for which maximum nullity equals the zero forcing number over an arbitrary field; equality does not hold for all extended cube graphs, and the conjectured field-independence and universal optimality remain unresolved in the supplied text.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.