Highly irregular graphs
Last update: 15 Dec 2020
| Contains: 21869 graphs
A connected graph is highly irregular if the neighbours of each vertex have distinct degrees. Such graphs exist on all orders except 3, 5 and 7. The census lists all highly irregular graphs up to the order 15 and was provided by Brendan McKay (
source).
OEIS:
A217246
