< Back to previous view
Sign in

Highly irregular graphs

Last update: 22 Dec 2015  | 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).

Collection comments

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here