Question

Make a conjecture about how to use the degree of the vertecies in a network to determine if the netwok is an Euler circit...... HELP!

Answer 1

http://en.wikipedia.org/wiki/Euler_circuit

Answer 2

Help please !
I dont know if they want a number answer or if its going to be a written answer

Answer 3

http://planetmath.org/encyclopedia/EulerCircuit.html

Answer 4

@ estudier that doesnt help, thanks tho

Answer 5

You really need to understand the properties in order to answer the question.

Answer 6

okay mathdrills i read the page u sent, i understand it but how will i solve this question?

Answer 7

Start with

An Eulerian cycle, Eulerian circuit or Euler tour in an undirected graph is a cycle that uses each edge exactly once.

Answer 8

Without just copying the conjecture on the website I gave you? Maybe re-word it or reference it.

Answer 9

how would i reword it without changing the info ?

Answer 10

This might help further:

http://www.ctl.ua.edu/math103/euler/howcanwe.htm