Several sharp upper bounds for the largest laplacian eigenvalue of a graph

Let K be the quasi-Laplacian matrix of a graph G and B be the adjacency matrix of the line graph of G,respectively.In this paper,we first present two sharp upper bounds for the largest Laplacian eigenvalue of G by applying the non-negative matrix theory to the similar matrix D~(-1/2) KD~(1/2) and U~(-1/2)BU~(1/2),respectively,where D is the degree diagonal matrix of G and U=diag(d_u,d_v,:uv∈E(G)). And then we give another type of the upper bound in terms of the degree of the vertex and the edge number of G.Moreover,we determine all extremal graphs which achieve these upper bounds.Finally, some examples are given to illustrate that our results are better than the earlier and recent ones in some sense.     

A formula for the powers of fractional order operators

We derive none some explicit formula for the power of fractional order (differential and integral) operators.     

Rank one perturbation and its application to the laplacian spectrum of a graph

Characterization of rank one perturbations of symmetric matrices which change only one eigenvalue are given. Then the result is applied to study how the Laplacian spectrum of a graph changes when adding an edge.     

Indecomposable laplacian integral graphs

A graph that can be constructed from isolated vertices by the operations of union and complement is decomposable. Every decomposable graph is Laplacian integral. i.e., its Laplacian spectrum consists entirely of integers. An indecomposable graph is not decomposable. The main purpose of this note is to demonstrate the existence of infinitely many indecomposable Laplacian integral graphs.     

A note on the second largest eigenvalue of the laplacian matrix of a graph

In this note, a lower bound for the second largest eigenvalue of the Laplacian matrix of a graph is given in terms of the second largest degree of the graph.     

The perturbed laplacian matrix of a graph

For a graph G, we define its perturbed Laplacian matrix as D?A(G) where A(G) is the adjacency matrix of G and D is an arbitrary diagonal matrix. Both the Laplacian matrix and the negative of the adjacency matrix are special instances of the perturbed Laplacian. Several well-known results, contained in the classical work of Fiedler and in more recent contributions of other authors are shown to be true, with suitable modifications, for the perturbed Laplacian. An appropriate generalization of the monotonicity property of a Fiedler vector for a tree is obtained. Some of the results are applied to interval graphs.     

On the univalence of functions with logharmonic laplacian

In this paper, we prove Radó’s theorem holds for functions of the form is logharmonic. We show that if F is of the form , where is logharmonic, then F is starlike iff ψ(z)=h(z)/g(z) is starlike. In addition, when , where L is logharmonic and H is harmonic, we give the sufficient conditions for F to be locally univalent.     

Inverse nodal problem for p–laplacian dirac system

In this study, we solve an inverse nodal problem for p‐Laplacian Dirac system with boundary conditions depending on spectral parameter. Asymptotic formulas of eigenvalues, nodal points and nodal lengths are obtained by using modified Prüfer substitution. The key step is to apply modified Prüfer substitution to derive a detailed asymptotic estimate for eigenvalues. Furthermore, we have shown that the functions r(x) and q(x) in Dirac system can be established uniquely by using nodal parameters with the method used by Wang et al. Obtained results are more general than the classical Dirac system. Copyright © 2016 John Wiley & Sons, Ltd.     

On bipartite graphs with small number of laplacian eigenvalues greater than two and three

All connected bipartite graphs with exactly two Laplacian eigenvalues greater than two are determined. Besides, all connected bipartite graphs with exactly one Laplacian eigenvalue greater than three are determined.     

Large families of laplacian isospectral graphs

Two graphs are isomorphic only if they are Laplacian isospectral, that is, their Laplacian matrices share the same multiset of eigenvalues. Large families of nonisomorphic Laplacian isospectral graphs are exhibited for which the common multiset of eigenvalues consists entirely of integers.     

On bipartite graphs with small number of laplacian eigenvalues greater than two and three

All connected bipartite graphs with exactly two Laplacian eigenvalues greater than two are determined. Besides, all connected bipartite graphs with exactly one Laplacian eigenvalue greater than three are determined.     

Large families of laplacian isospectral graphs

Two graphs are isomorphic only if they are Laplacian isospectral, that is, their Laplacian matrices share the same multiset of eigenvalues. Large families of nonisomorphic Laplacian isospectral graphs are exhibited for which the common multiset of eigenvalues consists entirely of integers.     

Nonexistence and symmetry of solutions to some fractional laplacian equations in the upper half space

In this article, we consider the fractional Laplacian equation(-△)~(α/2)u = K(x)f(u), x ∈ R_+~n,u ≡ 0, x/∈R_+~n,where 0 α 2, R_+~n:= {x =(x_1, x_2, ···, x_n)|x n 0}. When K is strictly decreasing with respect to |x′|, the symmetry of positive solutions is proved, where x′=(x_1, x_2, ···, x_(n-1)) ∈R~(n-1). When K is strictly increasing with respect to x n or only depend on x n, the nonexistence of positive solutions is obtained.     

The generalization of Faulhaber's formula to sums of non-integral powers

A formula for the sum of any positive-integral power of the first N positive integers was published by Johann Faulhaber in the 1600s. In this paper, we generalize Faulhaber's formula to non-integral complex powers with real part greater than −1.     

Lower bounds on the third smallest laplacian eigenvalue of a graph

We introduce a new graph-theoretic invariant ω(G) for a simple graph G, and relate it to the third smallest Laplace eigenvalue of G.     

Lower bounds on the third smallest laplacian eigenvalue of a graph

We introduce a new graph-theoretic invariant ω(G) for a simple graph G, and relate it to the third smallest Laplace eigenvalue of G.     

Bounding the sum of powers of the Laplacian eigenvalues of graphs

For a non-zero real number α, let s _α (G) denote the sum of the αth power of the non-zero Laplacian eigenvalues of a graph G. In this paper, we establish a connection between s _α (G) and the first Zagreb index in which the Hölder’s inequality plays a key role. By using this result, we present a lot of bounds of s _α (G) for a connected (molecular) graph G in terms of its number of vertices (atoms) and edges (bonds). We also present other two bounds for s _α (G) in terms of connectivity and chromatic number respectively, which generalize those results of Zhou and Trinajsti? for the Kirchhoff index [B Zhou, N Trinajsti?. A note on Kirchhoff index, Chem. Phys. Lett., 2008, 455: 120–123].     

Continuous random walks and fractional powers of operators

We derive a probabilistic representation for the Fourier symbols of the generators of some stable processes. This short paper represents a bridge between probabilists and researchers working in PDE?s.