The fractional Laplacian (−�)γ/2 commutes with the primary coordination transformations in the Euclidean space Rd: dilation, translation and rotation, and has tight link to splines, fractals and stable Levy processes. For 0 < γ < d, its inverse is the classical Riesz potential Iγ which is dilationinvariant and translation-invariant. In this work, we investigate the functional properties (contin...

Surface representation and processing is one of the key topics in computer graphics and geometric modeling, since it greatly affects the range of possible applications. In this paper, we propose a new Laplacian meshes deformation based-on the offset of sketching to solve the drawback that Laplacian coordinates are not invariant under rotation. First, we correct Laplacian coordinates rotation by...

The action of the isometry algebra Uh(sl(2)) on the h–deformed Lobachevsky plane is found. The invariant distance and the invariant 2–point functions are shown to agree precisely with the classical ones. The propagator of the Laplacian is calculated explicitely. It is invariant only after adding a “non–classical” sector to the Hilbert space.

Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...

Suppose μ1, μ2, ... , μn are Laplacian eigenvalues of a graph G. The Laplacian energy of G is defined as LE(G) = ∑n i=1 |μi − 2m/n|. In this paper, some new bounds for the Laplacian eigenvalues and Laplacian energy of some special types of the subgraphs of Kn are presented. AMS subject classifications: 05C50

The energy of a graph G is equal to the sum of absolute values of the eigenvalues of the adjacency matrix of G, whereas the Laplacian energy of a graph G is equal to the sum of the absolute value of the difference between the eigenvalues of the Laplacian matrix of G and average degree of the vertices of G. Motivated by the work from Sharafdini et al. [R. Sharafdini, H. Panahbar, Vertex weighted...

Several alternative definitions to graph energy have appeared in literature recently, the first among them being the Laplacian energy, defined by Gutman and Zhou in [Linear Algebra Appl. 414 (2006), 29–37]. We show here that Laplacian energy apparently has small power of discrimination among threshold graphs, by showing that, for each n, there exists a set of n mutually noncospectral connected ...