Integer sequence discovery from small graphs

DOI10.1016/J.DAM.2015.07.017MaRDI QIDQ908306zbMATH OpenOpenAlexWikidataFDO

Authors Travis Hoppe, Anna Petrone

Publication date 4 February 2016

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

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 1232919 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 6116733 (Why is no real title available?)
• A large database of graphs and its use for benchmarking graph isomorphism algorithms
• Engineering an efficient canonical labeling tool for large and sparse graphs
• Facet defining inequalities among graph invariants: The system graphedron
• Fast generation of regular graphs and construction of cages
• Generating rooted and free plane trees
• Generation and properties of snarks
• Generation of cubic graphs
• Graph Invariants as Necessary Conditions for Global Constraints
• Graph Theory and Probability
• Graph theory
• Graph theory
• House of Graphs: a database of interesting graphs
• Integer sequence discovery from small graphs
• Practical graph isomorphism. II.
• Ramsey numbers \(R(K_3, G)\) for graphs of order 10
• Small graphs with chromatic number 5: A computer search
• Spectra of graphs

Cited in

(3)

• scientific article; zbMATH DE number 1522333 (Why is no real title available?)
• Finding structure in sequences of real numbers via graph theory: a problem list
• Integer sequence discovery from small graphs

Describes a project that uses

Uses Software

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

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)