Graphs with integer index   The following table contains numbers of simple connected graphs with at most 10 vertices and integer index. There is only one connected graph with index 1 (it is K2) and exactly 17 connected graphs with index 2 and and no more than 10 vertices (these graphs are well known as Smith graphs and we omit their presentation here). Combining these values with the following table, we obtain the 1328 graphs with integer index. order / index 3 4 5 6 7 8 9 4 1 - - - - - - 5 1 1 - - - - - 6 2 1 1 - - - - 7 5 3 1 1 - - - 8 18 20 8 1 1 - - 9 36 103 18 11 1 1 - 10 135 582 256 91 8 2 1   Minimal self-centered graphs   A graph is self-centered if all vertices have equal eccentricity. The following table contains numbers of simple minimal self-centered graphs with at most 10 vertices. Graph K1 is self-centered (with radius 0). Also, there are 9 minimal self-centered graphs with radius 1 and no more than 10 vertices (K2 - K10). Combining these values with the following table, we obtain the 843 minimal self-centered graphs. order \ radius 2 3 4 5 4 1 - - - 5 2 - - - 6 4 1 - - 7 9 2 - - 8 29 8 1 - 9 102 27 2 - 10 518 118 8 1       If you use the above data on minimal self-centered graph in your research, please cite this paper: Z. Stanić, Some notes on minimal self-centered graphs, AKCE Int. J. Graphs Combin., 7 (2010) 97-102.