I'm looking for a clever algorithm to generate a list of all possible graphs with maximum degree D and diameter at most P such that any two graphs of this list are not isomorphic. Any ideas ?


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.