- #1
AdrianZ
- 319
- 0
Hi
Well, I know that in some few special cases It is easy to prove that 2 graphs can not be isomorphic. for example if they gave us two graphs that one of them were bipartite and the other were not, we can state that if the 2 graphs were isomorphic, then they would've had same mathematical properties. but is there anyway, in general, that can tell us whether 2 graphs are isomorphic or not? and if yes, how can we find a bijection between these two? in simple cases it might be not so hard, but when the number of vertices and edges increase this will certainly become very difficult.
I'm also looking for a way to prove Havel-Hakimi theorem. I'm new to Graph theory, so please don't introduce me very advanced stuff that I don't understand anything from them. lol another question, It's really hard for me to solve all the questions that my book wants me to solve them for practice. is there something wrong with me or It's a common phenomena when someone is new to graph theory? lol
Thanks
Well, I know that in some few special cases It is easy to prove that 2 graphs can not be isomorphic. for example if they gave us two graphs that one of them were bipartite and the other were not, we can state that if the 2 graphs were isomorphic, then they would've had same mathematical properties. but is there anyway, in general, that can tell us whether 2 graphs are isomorphic or not? and if yes, how can we find a bijection between these two? in simple cases it might be not so hard, but when the number of vertices and edges increase this will certainly become very difficult.
I'm also looking for a way to prove Havel-Hakimi theorem. I'm new to Graph theory, so please don't introduce me very advanced stuff that I don't understand anything from them. lol another question, It's really hard for me to solve all the questions that my book wants me to solve them for practice. is there something wrong with me or It's a common phenomena when someone is new to graph theory? lol
Thanks