Affiliation:
1. Eötvös Loránd University, Faculty of Informatics Budapest
Abstract
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.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Degree Sequence of Graph Operator for some Standard Graphs;Applied Mathematics and Nonlinear Sciences;2020-07-01
2. Independence number of graphs and line graphs of trees by means of omega invariant;Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A. Matemáticas;2020-02-26
3. An Improved Algorithm for Counting Graphical Degree Sequences of Given Length;2019 International Conference on Computational Science and Computational Intelligence (CSCI);2019-12
4. Efficient counting of degree sequences;Discrete Mathematics;2019-03
5. Narumi–Katayama index of the subdivision graphs;Journal of Taibah University for Science;2018-05-21