Kartal, BünyaminBayiz, Y. E.Koç, Aykut2022-01-262022-01-262021-06-031070-9908http://hdl.handle.net/11693/76808On the Euclidean domains of classical signal processing, linking of signal samples to underlying coordinate structures is straightforward. While graph adjacency matrices totally define the quantitative associations among the underlying graph vertices, a major problem in graph signal processing is the lack of explicit association of vertices with an underlying coordinate structure. To make this link, we propose an operation, called the vertex multiplication (VM), which is defined for graphs and can operate on graph signals. VM, which generalizes the coordinate multiplication (CM) operation in time series signals, can be interpreted as an operator that assigns a coordinate structure to a graph. By using the graph domain extension of differentiation and graph Fourier transform (GFT), VM is defined such that it shows Fourier duality that differentiation and CM operations are duals of each other under Fourier transformation (FT). Numerical examples and applications are also presented.EnglishGraph signal processing (GSP)Graph fourier transform (GFT)DualityCoordinate multiplicationVertex multiplicationArticle10.1109/LSP.2021.30863911558-2361