![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})
Abstract
Exhaustive catalogs of graphs can be an indispensable tool for computerized investigations in graph-theoretical research. We describe an algorithm for the creation of catalogs of regular graphs. Using this algorithm, all of the regular graphs on thirteen or fewer vertices have been created.