Deleting Vertices and Interlacing Laplacian Eigenvalues

The authors obtain an interlacing relation between the Laplacian spectra of a graph G and its subgraph G - U, which is obtained from G by deleting all the vertices in the vertex subset U together with their incident edges. Also, some applications of this interlacing property are explored and this interlacing property is extended to the edge weighted graphs.     

Some results on resistance distances and resistance matrices

In this paper, we obtain formulas for resistance distances and Kirchhoff index of subdivision graphs. An application of resistance distances to the bipartiteness of graphs is given. We also give an interlacing inequality for eigenvalues of the resistance matrix and the Laplacian matrix.     

Eigenvalue interlacing and weight parameters of graphs

Eigenvalue interlacing is a versatile technique for deriving results in algebraic combinatorics. In particular, it has been successfully used for proving a number of results about the relation between the (adjacency matrix or Laplacian) spectrum of a graph and some of its properties. For instance, some characterizations of regular partitions, and bounds for some parameters, such as the independence and chromatic numbers, the diameter, the bandwidth, etc., have been obtained. For each parameter of a graph involving the cardinality of some vertex sets, we can define its corresponding weight parameter by giving some “weights” (that is, the entries of the positive eigenvector) to the vertices and replacing cardinalities by square norms. The key point is that such weights “regularize” the graph, and hence allow us to define a kind of regular partition, called “pseudo-regular,” intended for general graphs. Here we show how to use interlacing for proving results about some weight parameters and pseudo-regular partitions of a graph. For instance, generalizing a well-known result of Lovász, it is shown that the weight Shannon capacity Θ^* of a connected graph Γ, with n vertices and (adjacency matrix) eigenvalues λ₁ > λ₂ … λ_n, satisfies

where Θ is the (standard) Shannon capacity and v is the positive eigenvector normalized to have smallest entry 1. In the special case of regular graphs, the results obtained have some interesting corollaries, such as an upper bound for some of the multiplicities of the eigenvalues of a distance-regular graph. Finally, some results involving the Laplacian spectrum are derived.     

The Laplacian spectral radius of graphs

The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we improve Shi’s upper bound for the Laplacian spectral radius of irregular graphs and present some new bounds for the Laplacian spectral radius of some classes of graphs.     

Bounds for the signless Laplacian energy

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. The Laplacian (respectively, the signless Laplacian) energy of G is the sum of the absolute values of the differences between the eigenvalues of the Laplacian (respectively, signless Laplacian) matrix and the arithmetic mean of the vertex degrees of the graph. In this paper, among some results which relate these energies, we point out some bounds to them using the energy of the line graph of G. Most of these bounds are valid for both energies, Laplacian and signless Laplacian. However, we present two new upper bounds on the signless Laplacian which are not upper bounds for the Laplacian energy.     

点删除下的图的$A_\alpha$特征值的交错性

设$G$为具有顶点集$V$, 边集$E$的简单图, 本文给出了图$G$与其子图$G-U$的$A_\alpha$特征值的交错不等式, 其中$U\subset V$. 作为应用, 我们利用该交错不等式导出了一些关于图的独立数, 点覆盖数, 哈密尔顿性及支撑数的$A_\alpha$ 谱条件.     

Gross Laplacian Acting on Operators

In this paper, we introduce a noncommutative extension of the Gross Laplacian, called quantum Gross Laplacian, acting on some analytical operators. For this purpose, we use a characterization theorem between this class of operators and their symbols. Applying the quantum Gross Laplacian to the particular case where the operator is the multiplication one, we establishes a relation between the classical and the quantum Gross Laplacians.      

Normalized Laplacian spectrum of some subdivision-coronas of two regular graphs

In this paper, we determine the full normalized Laplacian spectrum of the subdivision-vertex corona, subdivision-edge corona, subdivision-vertex neighbourhood corona and subdivision-edge neighbourhood corona of a connected regular graph with an arbitrary regular graph in terms of their normalized Laplacian eigenvalues. Moreover, applying these results, we find some non-regular normalized Laplacian cospectral graphs.     

Numerical enclosure for multiple eigenvalues of an Hermitian matrix whose graph is a tree

In this paper we consider a numerical enclosure method for multiple eigenvalues of an Hermitian matrix whose graph is a tree. If an Hermitian matrix A whose graph is a tree has multiple eigenvalues, it has the property that matrices which are associated with some branches in the undirected graph of A have the same eigenvalues. By using this property and interlacing inequalities for Hermitian matrices, we show an enclosure method for multiple eigenvalues of an Hermitian matrix whose graph is a tree. Since we do not generally know whether a given matrix has exactly a multiple eigenvalue from approximate computations, we use the property of interlacing inequalities to enclose some eigenvalues including multiplicities.In this process, we only use the enclosure of simple eigenvalues to enclose a multiple eigenvalue by using a computer and interval arithmetic.     

半正定Hermitian矩阵的广义Schur补的Lner偏序和特征值

首先得到了半正定 Hermitian矩阵的方幂的广义 Schur补的 L owner偏序的一些结果 ,然后改进了半正定 Hermitian矩阵的 Schur补的交错不等式 .     

Some sufficient spectral conditions on Hamilton-connected and traceable graphs

In this paper, we establish some sufficient conditions for a graph to be Hamilton-connected in terms of the edge number, the spectral radius and the signless Laplacian spectral radius of the graph. Furthermore, we also give some sufficient conditions for a graph to be traceable from every vertex in terms of the edge number, the spectral radius and the signless Laplacian spectral radius.     

On some properties of the Laplacian matrix revealed by the RCM algorithm

In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a Laplacian matrix that was reordered by the RCM algorithm. One of the theoretical results serves as a basis for writing an easy MATLAB code to detect connected components, by using the function “symrcm” of MATLAB. Some examples illustrate the theoretical results.     

对称Z-矩阵的惯量以及其Schur补的若干交错性质

In this Paper,the inertia of a symmetric Z-matrix is studied,and bounds of the number of its positive eigenvalues are obtained.Also the interlacing theorem for Schur complement of a symmetric Z-matrix is established,which can be considered as a generalization Cauchy interlacing theorem in some extent.     

Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs

We consider weighted graphs, where the edge weights are positive definite matrices. In this paper, we obtain two upper bounds on the spectral radius of the Laplacian matrix of weighted graphs and characterize graphs for which the bounds are attained. Moreover, we show that some known upper bounds on the Laplacian spectral radius of weighted and unweighted graphs can be deduced from our upper bounds.     

Signless Laplacians of finite graphs

We survey properties of spectra of signless Laplacians of graphs and discuss possibilities for developing a spectral theory of graphs based on this matrix. For regular graphs the whole existing theory of spectra of the adjacency matrix and of the Laplacian matrix transfers directly to the signless Laplacian, and so we consider arbitrary graphs with special emphasis on the non-regular case. The results which we survey (old and new) are of two types: (a) results obtained by applying to the signless Laplacian the same reasoning as for corresponding results concerning the adjacency matrix, (b) results obtained indirectly via line graphs. Among other things, we present eigenvalue bounds for several graph invariants, an interpretation of the coefficients of the characteristic polynomial, a theorem on powers of the signless Laplacian and some remarks on star complements.     

五边形图的标准化的拉普拉斯谱及其应用

一个图的标准化的拉普拉斯特征值对图在结构性质和一些相关的动力学方面提供了信息,尤其在相关的随机过程方面. 在这篇文章中,我们给出了由一个简单连通图迭代生成的五边形图的标准化的拉普拉斯谱.在应用方面,我们得到了关于倍增度基尔霍夫指数,凯梅尼常数和生成树的个数的重要公式.     

The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with <Emphasis Type="Italic">n</Emphasis> vertices and <Emphasis Type="Italic">k</Emphasis> pendant vertices

In this paper, the effects on the signless Laplacian spectral radius of a graph are studied when some operations, such as edge moving, edge subdividing, are applied to the graph. Moreover, the largest signless Laplacian spectral radius among the all unicyclic graphs with n vertices and k pendant vertices is identified. Furthermore, we determine the graphs with the largest Laplacian spectral radii among the all unicyclic graphs and bicyclic graphs with n vertices and k pendant vertices, respectively.     

完备流形上拉普拉斯算子的L2特征形式

本文研究了完备非紧流行上拉普拉斯算子的L²特征形式.利用应力能量张量的方法,得到在此类流形上拉普拉斯算子的L²特征形式的一些不存在性定理。     

UNIVERSAL INEQUALITIES FOR A HORIZONTAL LAPLACIAN VERSION OF THE CLAMPED PLATE PROBLEM ON CARNOT GROUP

In this paper, we investigate a horizontal Laplacian version of the clamped plate problem on Carnot groups and obtain some universal inequalities. Furthermore, for the lower order eigenvalues of this eigenvalue problem on carnot groups, we also give some universal inequalities.     

子图匹配数与图无符号拉普拉斯谱(英文)

设H是图G的一个子图.图G中同构于H的点不交的子图构成的集合称为G的一个H-匹配.图G的H-匹配的最大基数称为是G的H-匹配数,记为ν(H,G).本文主要研究ν(H,G)与G的无符号拉普拉斯谱的关系,同时也讨论了ν(H,G)与G的拉普拉斯谱的关系.