Integer sequence discovery from small graphs

DOI10.1016/J.DAM.2015.07.017zbMATH Open1329.05154arXiv1408.3644OpenAlexW1519873105WikidataQ39546733 ScholiaQ39546733MaRDI QIDQ908306FDOQ908306

Anna Petrone, Travis Hoppe

Publication date: 4 February 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia of Integer Sequences (OEIS). 141 new sequences were added and 6 sequences were appended or corrected. From the graph database, we were able to programmatically suggest relationships among the invariants. It will be shown that we can readily visualize any sequence of graphs with a given criteria. The code has been released as an open-source framework for further analysis and the database was constructed to be extensible to invariants not considered in this work.

Full work available at URL: https://arxiv.org/abs/1408.3644

Recommendations

• scientific article; zbMATH DE number 1522333
• The On-Line Encyclopedia of Integer Sequences
• House of Graphs: a database of interesting graphs
• Finding structure in sequences of real numbers via graph theory: a problem list
• scientific article; zbMATH DE number 758277

zbMATH Keywords

generatordatabaseinvariantinteger sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Connectivity (05C40) Database theory (68P15)

Cites Work

• House of Graphs: a database of interesting graphs
• Title not available (Why is that?)
• Practical graph isomorphism. II.
• Ramsey numbers \(R(K_3, G)\) for graphs of order 10
• The Generation of Fullerenes
• Title not available (Why is that?)
• Graph theory
• Fast generation of regular graphs and construction of cages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Spectra of graphs
• Graph Theory and Probability
• Title not available (Why is that?)
• Facet defining inequalities among graph invariants: The system graphedron
• Generation and properties of snarks
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• A large database of graphs and its use for benchmarking graph isomorphism algorithms
• Small graphs with chromatic number 5: A computer search
• Generating rooted and free plane trees
• Graph Invariants as Necessary Conditions for Global Constraints
• Integer sequence discovery from small graphs

Cited In (3)

• Finding structure in sequences of real numbers via graph theory: a problem list
• Integer sequence discovery from small graphs
• Title not available (Why is that?)

Uses Software

• nauty
• NetworkX
• PuLP
• House of Graphs
• OEIS
• Traces
• bliss
• GraPHedron
• GENREG
• snarkhunter
• Triangleramsey
• Graph-tool

This page was built for publication: Integer sequence discovery from small graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908306)