Statistics on Small Graphs
classification
🧮 math.CO
keywords
graphspresencevertex-labeledverticescategoriesclassifyconnectivitycreate
read the original abstract
We create the unlabeled or vertex-labeled graphs with up to 10 edges and up to 10 vertices and classify them by a set of standard properties: directed or not, vertex-labeled or not, connectivity, presence of isolated vertices, presence of multiedges and presence of loops. We present tables of how many graphs exist in these categories.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.