Integral saturation of adjacency-degree lattices
math.CO, cs.DM
Submitted: 2026-11-01
Updated: 2026-11-01
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- Caterpillar GNN: Replacing Message Passing with Graph-Level Aggregation
- Adjacency-degree algebras and spectral determination of graphs
- A Set-to-Set Distance Measure in Hyperbolic Space
- On the number of generalized cospectral mates of graphs
- Walk Matrix-Based Upper Bounds on Generalized Cospectral Mates
- Almost all graphs are determined by their generalized spectrum
- Degree-similar Unicyclic Graphs are Isomorphic
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality