This paper presents the results of two explorations: one, exhaustive, of the graph sets from 4 to 10 vertices, and other, using AGX-III program on graphs from 11 to 30 vertices, both looking for extremal graphs for two new irregularity measures. Some discussions on the obtained results are presented. The involved measures have polynomial complexity.