Vertex/Edge removal from isomorphic graphs

86 Views Asked by At

Given two isomorphic graphs $G$ and $G'$ that are undirected and weighted (or unweighted), does there exist a canonical sequence of edge removals from the graphs, such that the subgraphs at every step of the sequence remain isomorphic to one another? In other words, a removal of edges (possibly random or not) strategy that is invariant to isomorphism.