I'm posting Mad-Cool-Math nuggets this month.
H is for a Hamiltonian Graph.
There is a branch of mathematics called Graph Theory and, in this case, graphs are not bar graphs or line graphs. They look like a bunch of dots, some of which are connected by lines. Dots are called vertices and the lines are called edges. You're learning college-level math now, isn't it awesome?
Don't get too excited. This type of math is done in kindergarten classes all the time. How? Well, in a Hamiltonian Graph, you can forge a path along the edges that will pass through each of the vertices exactly once. Ready?
Make a Hamiltonian path for this graph:
Image courtesy: Science Kids
Congratulations! I knew you could do it.
Two more days to go on the free download of the novella Ursa Major. Response has been good, so thank you. And next week? There will be a different freebie. Stop by then for details.