Graph TheoryHardIsomorphism and Subgraphs
Isomorphism and Subgraphs · Hard problem
Let have vertices and edges . Let have vertices and edges . These two graphs are isomorphic. Under the (unique) isomorphism , vertex of is the only vertex of its degree in . Find .