Girth — length of the shortest cycle
EulerianCycle — find an Eulerian tour on a graph
ConnectedQ — test if a graph has only one component
ConnectedComponents — get lists of connected vertices
OrientGraph — find strongly connected orientation of a graph
ArticulationVertices — find cut points of a graph
EdgeConnectivity — minimal number of edges that disconnect the graph
