All Questions
Tagged with eulerian-path graph-isomorphism
2
questions
1
vote
2
answers
709
views
Non isomorphic graphs with closed eulerian chains
I need to construct 2 graphs that are non isomorphic and have 3 of the following properties.
Same number of vertices
Same number of edges
Both contain a closed eulerian path
I was thinking of the ...
- 29
7
votes
3
answers
9k
views
Sufficient condition for graph isomorphism assuming same degree sequence
We assume graph to be simple undirected.
In general, having the same degree sequence is not sufficient for two graphs to be isomorphic. A trivial example is a hexagon which is connected and two ...
- 8,820