On a new complete invariant of acyclic graphs
A. Prolubnikov
TL;DR
This paper introduces a novel complete invariant for acyclic graphs, providing a new way to uniquely identify and analyze their structure.
Contribution
The paper presents a new complete invariant for acyclic graphs, advancing graph theory and graph isomorphism testing.
Findings
The invariant uniquely characterizes acyclic graphs.
It simplifies graph isomorphism checks for acyclic graphs.
The method improves upon previous invariants.
Abstract
A new complete invariant for acyclic graphs is presented
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Matrix Theory and Algorithms · Finite Group Theory Research