Abstract
Performing comparative tests, some possibilities of constructing novel degree- and distance-based graph irregularity indices are investigated. Evaluating the discrimination ability of different irregularity indices, it is demonstrated (using examples) that in certain cases two newly constructed irregularity indices, namely
I
R
D
E
A
and
I
R
D
E
B
, are more selective.