Algebraic invariants of graphs; a study based on computer exploration
From MaRDI portal
Publication:4810172
DOI10.1145/377604.377612zbMath1052.05050arXiv0812.3082OpenAlexW1974704708MaRDI QIDQ4810172
Publication date: 1 September 2004
Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.3082
ringinvariant ringUlam's reconstruction conjectureconjecture of Pouzetisomorphism problems of graphslemma of Grigoriev
Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (7)
On reconstructing \(n\)-point configurations from the distribution of distances or areas ⋮ Separating invariants over finite fields ⋮ Applications of Multisymmetric Syzygies in Invariant Theory ⋮ Some relational structures with polynomial growth and their associated algebras II: Finite generation ⋮ Problems from CGCS Luminy, May 2007 ⋮ Hopf algebras of graphs. ⋮ Separating invariants
Uses Software
This page was built for publication: Algebraic invariants of graphs; a study based on computer exploration
