Rikki edited div_In_addition_there_are__.html  about 8 years ago

Commit id: 1e8f2b0408549e2d9e7fa061c213a151a8b9cc81

deletions | additions      

       

In addition, there are a few different types of graphs including Eulerian graphs and Hamiltonian graphs. 
 graphs. A graph is Eulerian if it is connected and \(G\) contains a closed trial with the use of every edge exactly once. Within Eulerian graphs, one can begin and end with any vertex. A graph is Hamiltonian