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
We study labeling-sensitive Fourier complexity for finite graph kernels. After identifying the vertices of a graph with the cyclic group , its adjacency matrix becomes…