circulant graphs 1fourier analysis 1graph energy 1graph kernels 1labeling invariants 1spectral graph theory 1
From the 1 of 2 linked papers with an AI index.
2 papers
math.CO2026
Edge complexity of graphs
Vishal Gupta, Alex Iosevich, Joshua Iosevich +2
Gupta and Iosevich introduced the edge complexity of a graph as the minimum Fourier ratio of its adjacency matrix over all vertex labelings and bounded it below by graph energy div…
math.CO2026
Fourier Ratios of Graph Kernels: Energy Bounds, Optimal Labelings, and Recovery
Vishal Gupta, Alex Iosevich
The paper introduces a labeling‑sensitive Fourier ratio invariant for finite graph kernels, derives lower bounds in terms of graph energy and Laplacian eigenvalue multiplicities, a…