Eigenfunctions and fundamental solutions of the fractional Laplace and Dirac operators: the Riemann-Liouville case

In this paper we study eigenfunctions and fundamental solutions for the three parameter fractional Laplace operator $\Delta_+^{(\alpha,\beta,\gamma)}:= D_{x_0^+}^{1+\alpha} +D_{y_0^+}^{1+\beta} +D_{z_0^+}^{1+\gamma},$ where $(\alpha, \beta, \gamma) \in \,]0,1]^3$, and the fractional derivatives $D_{x_0^+}^{1+\alpha}$, $D_{y_0^+}^{1+\beta}$, $D_{z_0^+}^{1+\gamma}$ are in the Riemann-Liouville sense. Applying operational techniques via two-dimensional Laplace transform we describe a complete family of eigenfunctions and fundamental solutions of the operator $\Delta_+^{(\alpha,\beta,\gamma)}$ in classes of functions admitting a summable fractional derivative. Making use of the Mittag-Leffler function, a symbolic operational form of the solutions is presented. From the obtained family of fundamental solutions we deduce a family of fundamental solutions of the fractional Dirac operator, which factorizes the fractional Laplace operator. We apply also the method of separation of variables to obtain eigenfunctions and fundamental solutions.

Eigenfunctions and fundamental solutions of the Caputo fractional Laplace and Dirac operators

In this paper, by using the method of separation of variables, we obtain eigenfunctions and fundamental solutions for the three parameter fractional Laplace operator defined via fractional Caputo derivatives. The solutions are expressed using the Mittag-Leffler function and we show some graphical representations for some parameters. A family of fundamental solutions of the corresponding fractional Dirac operator is also obtained. Particular cases are considered in both cases.

Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs

Consider two graphs G and H. Let H^k[G] be the lexicographic product of H^k and G, where H^k is the lexicographic product of the graph H by itself k times. In this paper, we determine the spectrum of H^k[G]H and H^k when G and H are regular and the Laplacian spectrum of H^k[G] and H^k for G and H arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic powers of regular graphs, and to the algebraic connectivity and the largest Laplacian eigenvalues in the case of lexicographic powers of arbitrary graphs. This approach allows the determination of the spectrum (in case of regular graphs) and Laplacian spectrum (for arbitrary graphs) of huge graphs. As an example, the spectrum of the lexicographic power of the Petersen graph with the googol number (that is, 10^100 ) of vertices is determined. The paper finishes with the extension of some well known spectral and combinatorial invariant properties of graphs to its lexicographic powers.

Extremal graphs for the sum of the two largest signless Laplacian eigenvalues

Let G be a simple graph on n vertices and e(G) edges. Consider the signless Laplacian, Q(G) = D + A, where A is the adjacency matrix and D is the diagonal matrix of the vertices degree of G. Let q1(G) and q2(G) be the first and the second largest eigenvalues of Q(G), respectively, and denote by S+ n the star graph with an additional edge. It is proved that inequality q1(G)+q2(G) e(G)+3 is tighter for the graph S+ n among all firefly graphs and also tighter to S+ n than to the graphs Kk _ Kn−k recently presented by Ashraf, Omidi and Tayfeh-Rezaie. Also, it is conjectured that S+ n minimizes f(G) = e(G) − q1(G) − q2(G) among all graphs G on n vertices.

A lower bound for the energy of symmetric matrices and graphs

The energy of a symmetric matrix is the sum of the absolute values of its eigenvalues. We introduce a lower bound for the energy of a symmetric partitioned matrix into blocks. This bound is related to the spectrum of its quotient matrix. Furthermore, we study necessary conditions for the equality. Applications to the energy of the generalized composition of a family of arbitrary graphs are obtained. A lower bound for the energy of a graph with a bridge is given. Some computational experiments are presented in order to show that, in some cases, the obtained lower bound is incomparable with the well known lower bound $2\sqrt{m}$, where $m$ is the number of edges of the graph.