1->2, 2->3, 3->1, 3->4, 4->1
Assuming "1->2" is referring to a graph | Use as instead
Assuming undirected edges | Use as instead

Input interpretation

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

Image

Image

Canonical graph name

diamond graph

Basic properties

vertex count | 4 edge count | 5 connected component count | 1

Graph features

biconnected | connected | Hamiltonian | nonempty | noneulerian | planar | simple | traceable | undirected
POWERED BY THE WOLFRAM LANGUAGE