Skip to content

Author

Vishal Gupta

We have 2 of 4 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Edge complexity of weighted graphs: involutory symmetries and NP-hardness

The edge complexity of a weighted graph is the smallest ratio of the Fourier $\ell^1$ and $\ell^2$ norms of its adjacency matrix over all vertex labelings. We study the difficulty of finding this minimum by relating it to a graph symmetry. Adding a universal vertex with sufficiently large incident weight produces an ex...

Vishal Gupta, A. Iosevich · 0 citations
Preprint Jul 2026

Edge complexity of graphs

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 divided by the square root of twice the number of edges. We characterize equality for a fixed labeling: the Fourier transform of the adjacency...

Vishal Gupta, A. Iosevich, J. Iosevich et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.