The nonsingular edge-extension conjecture for connected block graphs
The nonsingular edge-extension conjecture for connected block graphs
Let and be connected nonsingular block graphs, meaning their adjacency matrices are nonsingular. Choose vertices and with and , where
Nonsingular edge-extension conjecture. If an edge is added between vertices and , then the resulting block graph is nonsingular.
The source motivates this as a block-graph-specific claim after noting that joining two nonsingular graphs by an edge can produce a singular graph in general. Its resolution is not indicated in the source.
Sources & referencesView supporting material
Primary source
Ranveer Singh, Cheng Zheng, Naomi Shaked-Monderer and Abraham Berman, “Nonsingular Block Graphs: An Open Problem”, arXiv:1803.03947 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.