A new record of enumeration of regular graphs by parallel processing

07/29/2019
by   Zhipeng Xu, et al.
0

We broke a record, set 8 years ago, in the enumeration of non-isomorphic regular graphs by expanding the sequence of A006820 in OEIS, to achieve the number for 4-regular graphs of order 23 as 429,668,180,677,439, while discovering serval optimal regular graphs with minimum diameters. The number of 4-regular graphs and the optimal graphs, extremely time-consuming to calculate, result from a method we adapt from GENREG, a classical regular graph generator, to fit for supercomputers' strengths of using thousands of processor cores.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/29/2019

A new record of graph enumeration enabled by parallel processing

Using three supercomputers, we broke a record set in 2011, in the enumer...
research
07/29/2019

Enumeration of regular graphs by using the cluster in high efficiency

In this note, we proposed a method to enumerate regular graphs on the cl...
research
02/04/2022

On chromatic parameters of some Regular graphs

In this work, we try to enunciate the Total chromatic number of some Cay...
research
08/20/2020

On Fine-Grained Exact Computation in Regular Graphs

We show that there is no subexponential time algorithm for computing the...
research
08/30/2019

Existence of d-regular nut graphs for d at most 11

A nut graph is a singular graph with one-dimensional kernel and correspo...
research
04/26/2019

Regular Expression Matching on billion-nodes Graphs

In many applications, it is necessary to retrieve pairs of vertices with...
research
08/30/2019

Existence of regular nut graphs for degree at most 11

A nut graph is a singular graph with one-dimensional kernel and correspo...

Please sign up or login with your details

Forgot password? Click here to reset