I want to do many things, but I don’t have much time. Therefore I’m trying to do three activities together: English, maths and writhe in my blog.
At present I’m interested in chess too, but I’m newbie in that, so I don’t talking about it.
I'm going to talk about a problem of my maths class.
There is a theorem that says: a graph is an Hamiltonian graph if when we remove a number of dots, the number of connected subgraphs that remains are less or equal than number of dots removed.
Is the next graph, an Hamiltonian graph (A)?
As you can see, we can remove two dots creating three subgraphs (B), therefore the graph isn’t Hamiltonian.
Please, feel free to correct my English.
No hay comentarios:
Publicar un comentario