Graphs with equal laziness

Characterize graphs on the same number of vertices that have equal laziness.

Background

The authors observe that paths and their complements are not the only graphs attaining the minimum laziness suggested by their computational data. This observation motivates the unresolved classification problem of determining which graphs with a fixed number of vertices share the same value of the laziness invariant.