Hi there..I have a question about Eulerian graphs: For which n is Kn,m Eulerian? - I'm just not sure how to figure this out, I'm quite new to Eulerian Graphs. Thank you all!
Follow Math Help Forum on Facebook and Google+
Originally Posted by March14 Hi there..I have a question about Eulerian graphs: For which n is Kn,m Eulerian? What exactly is meant by a graph being Eulerian according to your textbook? Is enough to be simply traceable or must the trace be closed?
Originally Posted by Plato What exactly is meant by a graph being Eulerian according to your textbook? Is enough to be simply traceable or must the trace be closed? It must be closed and each degree is even. Thus, I believe the answer to this would be Kn,m is Eulerian If and only if both m and n are even? Can anyone check my above answer?
Originally Posted by March14 It must be closed and each degree is even. Thus, I believe the answer to this would be Kn,m is Eulerian If and only if both m and n are even? Correct.
View Tag Cloud