The nonsingular edge-extension conjecture for connected block graphs

Let G1G_1 and G2G_2 be connected nonsingular block graphs, meaning their adjacency matrices are nonsingular. Choose vertices v1otinV(G2)v_1 otin V(G_2) and v2otinV(G1)v_2 otin V(G_1) with v1otinV(G2)v_1 otin V(G_2) and v2otinV(G1)v_2 otin V(G_1), where v1g?v_1 g\text{?}

Nonsingular edge-extension conjecture. If an edge is added between vertices v1V(G1)v_1\rtimes V(G_1) and v2V(G2)v_2\rtimes V(G_2), 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

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.