1 citations · 1 across the 5 of their papers we have counts for
6 papers
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 ,…
Edge complexity of weighted graphs: involutory symmetries and NP-hardness
Vishal Gupta, Alex Iosevich
The edge complexity of a weighted graph is the smallest ratio of the Fourier and norms of its adjacency matrix over all vertex labelings. We study the difficulty…
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…
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…
A Ricci flow on graphs from effective resistance
Aleyah Dawkins, Vishal Gupta, Mark Kempton +4
In this paper, we introduce a new notion of curvature on the edges of a graph that is defined in terms of effective resistances. We call this the Ricci--Foster curvature. We study…
Node resistance curvature in Cartesian graph products
Aleyah Dawkins, Vishal Gupta, Mark Kempton +4
Devriendt and Lambiotte recently introduced the \emph{node resistance curvature}, a notion of graph curvature based on the effective resistance matrix. In this paper, we begin the…