Wolfram|Alpha

Computing...

Input interpretation:

1->2 | 2->3 | 3->1 | 3->4 | 4->1  (undirected graph)


Image:



Basic properties:

vertex count | 4\nedge count | 5\nconnected component count | 1


Graph features:

connected  |  Hamiltonian  |  nonempty  |  noneulerian  |  perfect  |  planar  |  simple  |  traceable  |  undirected

ComputingComputing...