2 papers
math.CO2026
Additive energy and Fourier complexity of graphs
Vishal Gupta, Sam Ferguson, Alex Iosevich +3
We study the additive energy and the Fourier approximation of graph adjacency matrices labeled by a cyclic group. For a graph with vertices, edges and adjacency matrix ,…
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…