A graph is said to be Laplacian integral if the spectrum of its Laplacian matrix consists entirely of integers. Using combinatorial and matrix-theoretic techniques, we identify, up to isomorphism, the 21 connected Laplacian integral graphs of maximum degree 3 on at least 6 vertices.

Since WorldView-2 (WV-2) images are widely used in various fields, there is a high demand for the use of high-quality pansharpened WV-2 images for different application purposes. With respect to the novelty of the WV-2 multispectral (MS) and panchromatic (PAN) bands, the performances of eight state-of-art pan-sharpening methods for WV-2 imagery including six datasets from three WV-2 scenes were...

We study the optimal sets Ω∗ ⊂ R for spectral functionals F ( λ1(Ω), . . . , λp(Ω) ) , which are bi-Lipschitz with respect to each of the eigenvalues λ1(Ω), . . . , λp(Ω) of the Dirichlet Laplacian on Ω, a prototype being the problem min { λ1(Ω) + · · ·+ λp(Ω) : Ω ⊂ R, |Ω| = 1 } . We prove the Lipschitz regularity of the eigenfunctions u1, . . . , up of the Dirichlet Laplacian on the optimal se...

We consider scattering by an obstacle in Rd, d ≥ 3 odd. We show that for the Neumann Laplacian if an obstacle has the same resonances as the ball of radius ρ does, then the obstacle is a ball of radius ρ. We give related results for obstacles which are disjoint unions of several balls of the same radius.

We provide an analysis of the expected meeting time of two independent random walks on a regular graph. For 1-D circle and 2-D torus graphs, we show that the expected meeting time can be expressed as the sum of the inverse of non-zero eigenvalues of a suitably defined Laplacian matrix. We also conjecture based on empirical evidence that this result holds more generally for simple random walks o...

Let G be a graph with n vertices. We denote the largest signless Laplacian eigenvalue of G by q1(G) and Laplacian eigenvalues of G by μ1(G) > · · · > μn−1(G) > μn(G) = 0. It is a conjecture on Laplacian spread of graphs that μ1(G)−μn−1(G) 6 n − 1 or equivalently μ1(G) + μ1(G) 6 2n − 1. We prove the conjecture for bipartite graphs. Also we show that for any bipartite graph G, μ1(G)μ1(G) 6 n(n − ...

We consider the critical dissipative SQG equation in bounded domains, with the square root of the Dirichlet Laplacian dissipation. We prove global a priori interior C and Lipschitz bounds for large data.

The 1D discrete fractional Laplacian operator on a cyclically closed (periodic) linear chain with finite number N of identical particles is introduced. We suggest a ”fractional elastic harmonic potential”, and obtain the N -periodic fractional Laplacian operator in the form of a power law matrix function for the finite chain (N arbitrary not necessarily large) in explicit form. In the limiting ...

The normalized Laplacian of a graph was introduced by F.R.K. Chung and has been studied extensively over the last decade. In this paper, we introduce the notion of the normalized Laplacian of signed graphs and extend some fundamental concepts of the normalized Laplacian from graphs to signed graphs.

In this paper graphs with the largest Laplacian eigenvalue at most 4 are characterized. Using this we show that the graphs with the largest Laplacian eigenvalue less than 4 are determined by their Laplacian spectra. Moreover, we prove that ones with no isolated vertex are determined by their adjacency spectra.