A graph is a tree if any two vertices are connected by a unique path of edges.
i1 : G = graph({{1,2},{1,3},{3,4},{3,5}},EntryMode=>"edges"); |
i2 : isTree G o2 = true |
The object isTree is a method function.