Search Results

You are looking at 1 - 1 of 1 items for

  • Author: Gergő Gombos x
Clear All Modify Search
Open access

Antal Iványi, Gergő Gombos, Loránd Lucz and Tamás Matuszka

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.