I guess at the very least it can serve as a useful 'edge case' test for an implementation of an algorithm operating on a graph. E.g. the Peterson graph[1] is al

I guess at the very least it can serve as a useful 'edge case' test for an implementation of an algorithm operating on a graph. E.g. the Peterson graph[1] is also quite useful for that. [1] https://en.wikipedia.org/wiki/Petersen_graph https://en.wikipedia.org/wiki/Petersen_graph