DIY Challenge 4: Counting the connections
In the graphs, you see a number written at each vertex. It shows the number of total connections at that point.
Some of the these are possible and some are not possible according to the rules we had.
You have 2 tasks now.
-
For the graphs in the previous challenge, write the number of connections at each vertex.
-
After you do the above, using all the examples we have now, do you observe a pattern or a rule which can directly tell us whether a path is possible or not?
What is special above some graphs that make them impossible to draw?
What students worked out12
Student 11
For part 1
Student 2
2 3 4 6 are possible
1 5 are not
graphs that are all even are possible
if there is odd then it is impossible
this was answer 2 for task 2Student 3
If all vertices have even number of connections are there then it is possible
also if you have 2 odd connections then also it is possible to draw without lifting pen. however more than 2 odd connection can not be drawn.Student 1
If all vertices have an even amount of bridges it works
Student 1
I take that back
Student 1
This is what I found
Student 1
My document
Student 18
.
Student 9
This is what I found
Student 9
2. After you do the above, using all the examples we have now, do you observe a pattern or a rule which can directly tell us whether a path is possible or not?
What is special above some graphs that make them impossible to draw?(sir not able to find)
Student 14
This is what I found for task one.
Student 14
It matters on the number of odd and even connections, and even on the shape of the graph.