The nullity conjecture for connected block graphs with blocks of order at least 3
Statement
Let be a connected block graph, meaning a graph in which every biconnected component is a clique. The nullity of is the dimension of the kernel of its adjacency matrix.
Nullity conjecture. If each block of has order at least , then the nullity of is at most .
This conjecture concerns the adjacency-matrix nullity of -forbidden block graphs. Its resolution is not indicated in the source.
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.