4 ms·
In your hypothetical case the vertices would be labeled by friends' names or ids. So you only have to check whether the obvious isomorphism applies i.e. that t
by bmm6o 11y ago
In your hypothetical case the vertices would be labeled by friends' names or ids. So you only have to check whether the obvious isomorphism applies i.e. that the graphs are equivalent as sets.
- OJFord 11y agoAh, yes that's true of course - I clearly wasn't thinking.. Well, then I can't even contrive an example! Still, it's interesting; I wish I had the background to understand it better.