<abstract xmlns="http://www.w3.org/1999/xhtml"> In the paper we report on the parallel enumeration of the degree sequences (their number is denoted by G(n)) and zerofree degree sequences (their number is denoted by (Gz(n)) of simple graphs on n = 30 and n = 31 vertices. Among others we obtained that the number of zerofree degree sequences of graphs on n = 30 vertices is Gz(30) = 5 876 236 938 019 300 and on n = 31 vertices is Gz(31) = 22 974 847 474 172 374. Due to Corollary 21 in [52] these results give the number of degree sequences of simple graphs on 30 and 31 vertices.</abstract>

In the paper we report on the parallel enumeration of the degree sequences (their number is denoted by G(n)) and zerofree degree sequences (their number is denoted by (Gz(n)) of simple graphs on n = 30 and n = 31 vertices. Among others we obtained that the number of zerofree degree sequences of graphs on n = 30 vertices is Gz(30) = 5 876 236 938 019 300 and on n = 31 vertices is Gz(31) = 22 974 847 474 172 374. Due to Corollary 21 in [52] these results give the number of degree sequences of simple graphs on 30 and 31 vertices.

Parallel enumeration of degree sequences of simple graphs II

Eötvös Loránd University, Faculty of Informatics Budapest

Acta Universitatis Sapientiae, Informatica

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

{"article-title":"Parallel enumeration of degree sequences of simple graphs II"}

In the paper we report on the parallel enumeration of the degree sequences (their number is denoted by G(n)) and zerofree degree sequences (their number is...

Parallel enumeration of degree sequences of simple graphs II

Pubblicato online: 30 mag 2014

Pagine: 245 - 270

Ricevuto: 10 ago 2013

DOI: https://doi.org/10.2478/ausi-2014-0013

Parole chiave
simple directed graphs, linear Erdős-Gallai and Havel-Hakimi algorithm, enumeration of graphical sequences

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Parallel enumeration of degree sequences of simple graphs II

Pubblicato online: 30 mag 2014

Pagine: 245 - 270

Ricevuto: 10 ago 2013

DOI: https://doi.org/10.2478/ausi-2014-0013

Parole chiavesimple directed graphs, linear Erdős-Gallai and Havel-Hakimi algorithm, enumeration of graphical sequences

© 2014

This article is distributed under the terms of the Creative Commons Attribution Non-Commercial License, which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Parole chiave
simple directed graphs, linear Erdős-Gallai and Havel-Hakimi algorithm, enumeration of graphical sequences