English

Statistics on Small Graphs

Combinatorics 2017-09-27 v1

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.

Keywords

Cite

@article{arxiv.1709.09000,
  title  = {Statistics on Small Graphs},
  author = {Richard J. Mathar},
  journal= {arXiv preprint arXiv:1709.09000},
  year   = {2017}
}

Comments

47 pages, 88 tables

R2 v1 2026-06-22T21:55:14.255Z