Objects, Invariants and Properties for Graph Theory (GT) automated conjecturing: in particular with the Sage program CONJECTURING: http://nvcleemp.github.io/conjecturing/
M. Dahir conjectured that is G and H are graphs with distance matrices Gd and Hd and
(Gd)(Hd)(Gd) is similar to (Hd)(Gd)(Hd) then G and H are isomorphic.
This is False. Here is a counterexample pair:
G = Graph(r"K?Bcvb[nBUNO")
H = Graph(r"K?Bcv`\nFSNO")
(Gd)(Hd)(Gd) ~ (Hd)(Gd)(Hd) but G and H are not isomorphic.
jaritaes99
commented
3 years ago
M. Dahir conjectured that is G and H are graphs with distance matrices Gd and Hd and (Gd)(Hd)(Gd) is similar to (Hd)(Gd)(Hd) then G and H are isomorphic.
This is False. Here is a counterexample pair:
G = Graph(r"K?Bcvb[nBUNO") H = Graph(r"K?Bcv`\nFSNO")
(Gd)(Hd)(Gd) ~ (Hd)(Gd)(Hd) but G and H are not isomorphic.