this paper is devoted to the spectral theory (more precisely, tothe variational theory of the spectrum) of guided waves in anelastic half cylinder.  we use variational methods to investigateseveral aspects of propagating waves, including localization (seefigure 1), existence criteria and the formulas to find them. weapproach the problem using two complementary methods: thevariational methods fo...

We propose an efficient heuristic for mapping the logical qubits of quantum algorithms to physical connectivity-limited devices, adding a minimal number connectivity-compliant SWAP gates. In particular, given circuit, we construct undirected graph with edge weights function two-qubit gates circuit. Taking inspiration from spectral drawing, use eigenvector Laplacian place at coordinate locations...

The Laplacian and normalized Laplacian energy of G are given by expressions EL(G) = ∑n i=1 |μi − d|, EL(G) = ∑n i=1 |λi − 1|, respectively, where μi and λi are the eigenvalues of Laplacian matrix L and normalized Laplacian matrix L of G. An interesting problem in spectral graph theory is to find graphs {L,L}−noncospectral with the same E{L,L}(G). In this paper, we present graphs of order n, whi...

Spectral graph theory looks at the interplay between the structure of a graph and the eigenvalues of a matrix associated with the graph. Many interesting graphs have rich structure which can help in determining the eigenvalues associated with some particular matrix of a graph. This survey looks at some common techniques in working with and determining the eigenvalues associated with the normali...

Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path Z. In the present paper, we develop a spectral analysis for lamplighter random walks on finite graphs. In the general case, we use the C2-symmetry to reduce the spectral computations to a series of eigenvalue problems on the underlying graph. In th...