Discrete Fourier Calculus and Graph Reconstruction

Vito ABATANGELO; Sorin DRAGOMIR

doi:10.4036/iis.2007.163

Interdisciplinary Information Sciences

Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050

Discrete Fourier Calculus and Graph Reconstruction

Vito ABATANGELO, Sorin DRAGOMIR

Author information

Keywords: Hamming graph, combinatorial Laplacian, discrete Fourier transform, fundamental solution, unlabelling operator, vertex-switching reconstruction problem

JOURNAL FREE ACCESS

2007 Volume 13 Issue 2 Pages 163-180

DOI https://doi.org/10.4036/iis.2007.163

Details

Abstract

Building on results of E. Barletta et al., [4], we give several applications of discrete Fourier calculus and the convolution product of functions defined on binary codes and generalize a result by R.P. Stanley, [17], on the vertex-switching reconstruction problem.

Content from these authors

This article is licensed under a Creative Commons [Attribution 4.0 International] license.
https://creativecommons.org/licenses/by/4.0/

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!