In this paper, we give some properties of the left and right finite Caputo derivatives. Such derivatives lead to finite Riesz type fractional derivative, which could be considered as the fractional power of the Laplacian operator modelling the dynamics of many anomalous phenomena in super-diffusive processes. Finally, the exact solutions of certain fractional diffusion partial differential equa...

The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.

connections between integral kernels of positivity preserving semigroups and suitable Lp contractivity properties are established. Then these questions are studied for the semigroups generated by -A + V and H,, the Dirichlet Laplacian for an open, connected region Q. As an application under a suitable hypothesis, Sobolev estimates are proved valid up to 352, of the form /n(x)1 ,< coo(x) lJHk,nl...

We study the Robin Laplacian in a domain with two corners of the same opening, and we calculate the asymptotics of the two lowest eigenvalues as the distance between the corners increases to infinity.

Using the improved lower bound on the sum of the eigenvalues of the Dirichlet Laplacian proved by A. D. Melas (Proc. Amer. Math. Soc. 131 (2003) 631-636), we report a new and sharp estimate for the dimension of the global attractor associated to the complex Ginzburg-Landau equation supplemented with Dirichlet boundary conditions.

The reciprocal distance Laplacian matrix of a connected graph G is defined as RDL(G)=RT(G)−RD(G), where RT(G) the diagonal degrees and RD(G) Harary matrix. Clearly, RDL(G) real symmetric matrix, we denote its eigenvalues λ1(RDL(G))≥λ2(RDL(G))≥…≥λn(RDL(G)). largest eigenvalue λ1(RDL(G)) RDL(G), denoted by λ(G), called spectral radius. In this paper, obtain several upper bounds for sum k in terms...

In this paper, the product distance matrix of a tree is defined and formulas for its determinant and inverse are obtained. The results generalize known formulas for the exponential distance matrix. When the number of variables are restricted to two, the bivariate analogue of the laplacian matrix of an arbitrary graph is defined. Also defined in this paper is a bivariate analogue of the Ihara-Se...

For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.

For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.

Spectral graph theory gives an algebraical approach to analyze the dynamics of a network by using the matrix that represents the network structure. However, it is not easy for social networks to apply the spectral graph theory because the matrix elements cannot be given exactly to represent the structure of a social network. The matrix element should be set on the basis of the relationship betw...