On the Laplacian energy of a graph

In this paper we consider the energy of a simple graph with respect to its Laplacian eigenvalues, and prove some basic properties of this energy. In particular, we find the minimal value of this energy in the class of all connected graphs on n vertices (n = 1, 2, ...). Besides, we consider the class of all connected graphs whose Laplacian energy is uniformly bounded by a constant α ⩾ 4, and completely describe this class in the case α = 40.     

On the full Brouwer's Laplacian spectrum conjecture

Let G be a simple connected graph and let $S_k(G)$ be the sum of the first k largest Laplacian eigenvalues of G. It was conjectured by Brouwer in 2006 that $S_k(G)\le e(G)+\left(\begin{array}{c}k+1\\ 2\end{array}\right)$ holds for $1\le k\le n?1$. The case $k=2$ was proved by Haemers, Mohammadian and Tayfeh-Rezaie [Linear Algebra Appl., 2010]. In this paper, we propose the full Brouwer's Laplacian spectrum conjecture and we prove the conjecture holds for $k=2$ which also confirm the conjecture of Guan et al. in 2014.     

On the approximation of Laplacian eigenvalues in graph disaggregation

Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient computation in parallel. In particular, we consider computations involving the graph Laplacian, which has significant applications, including diffusion mapping and graph partitioning, among others. We prove results regarding the spectral approximation of the Laplacian of the original graph by the Laplacian of the disaggregated graph. In addition, we construct an alternate disaggregation operator whose eigenvalues interlace those of the original Laplacian. Using this alternate operator, we construct a uniform preconditioner for the original graph Laplacian.     

The spectrum of infinite regular line graphs

Let be an infinite -regular graph and its line graph. We consider discrete Laplacians on and , and show the exact relation between the spectrum of and that of . Our method is also applicable to -semiregular graphs, subdivision graphs and para-line graphs.

     

基于拉普拉斯谱确定的两类树

设图G是简单连通图.如果任何一个与图G关于拉普拉斯矩阵同谱的图,都与图G同构,称图G可由其拉普拉斯谱确定.定义了树Y_n和树F(2,n,1)两类特殊结构的树.利用同谱图线图的特点,证明了树Y_n和树F(2,n,1)可由其拉普拉斯谱确定.     

On graphs with three distinct Laplacian eigenvalues

In this paper,an equivalent condition of a graph G with t(2≤t≤n)distinct Laplacian eigenvalues is established.By applying this condition to t=3,if G is regular(neces- sarily be strongly regular),an equivalent condition of G being Laplacian integral is given.Also for the case of t=3,if G is non-regular,it is found that G has diameter 2 and girth at most 5 if G is not a tree.Graph G is characterized in the case of its being triangle-free,bipartite and pentagon-free.In both cases,G is Laplacian integral.     

k圈图的最大Laplace分离度

设$ G $是一个$ n $阶$ k $圈图, $ k $圈图为边数等于顶点数加$ k-1 $的简单连通图。$ \mu_{1}(G) $、$ \mu_{2}(G) $分别记为图$ G $的Laplace矩阵的最大特征值和次大特征值, 图$ G $的Laplace分离度定义为$ S_{L}(G)=\mu_{1}(G)-\mu_{2}(G) $。本文研究了给定阶数的$ k $圈图的最大Laplace分离度, 并刻画了相应的极图, 其结果推广了已有当$ k=1, 2, 3 $时的结论。     

k圈图的最大Laplace分离度

设$ G $是一个$ n $阶$ k $圈图, $ k $圈图为边数等于顶点数加$ k-1 $的简单连通图。$ \mu_{1}(G) $、$ \mu_{2}(G) $分别记为图$ G $的Laplace矩阵的最大特征值和次大特征值, 图$ G $的Laplace分离度定义为$ S_{L}(G)=\mu_{1}(G)-\mu_{2}(G) $。本文研究了给定阶数的$ k $圈图的最大Laplace分离度, 并刻画了相应的极图, 其结果推广了已有当$ k=1, 2, 3 $时的结论。     

Laplace特征值的一点注记

确定具有n个顶点e条边的图的Laplace的最大谱半径.     

On the spectrum of an infinite graph

We exhibit an example of an infinite locally finite graph such that its adjacency operator is not self-adjoint. This gives a negative answer to a conjecture of Mohar [1].     

一些双联运算图的规范拉普拉斯谱

研究了基于剖分图、Q-图、R-图和全图的双联运算图的四类变型,给出了它们的规范拉普拉斯谱.所得结果推广了关于图的联运算的一些已有结果.     

不含三圈的k圈图的拟拉普拉斯和拉普拉斯谱半径

k圈图是边数等于顶点数加k-1的简单连通图.文中确定了不含三圈的k圈图的拟拉普拉斯谱半径的上界,并刻画了达到该上界的极图.此外,文中确定了拟拉普拉斯谱半径排在前五位的不含三圈的单圈图,排在前八位的不含三圈的双圈图.最后说明文中所得结论对不含三圈的k圈图的拉普拉斯谱半径也成立.     

On determination of caterpillars with four terminal vertices by their Laplacian spectrum

We consider the class of caterpillars with four terminal vertices. Here we prove that every of such caterpillar whose internal path differs in length from both 1 to 3 is uniquely determined by its Laplacian spectrum. Next we take into consideration the remaining two possibilities for the internal path. In the first situation we prove that there is exactly one caterpillar which is not determined by its Laplacian spectrum, while we find an infinite family of such caterpillars in the second. Finally, some observations are given.     

Signless Laplacian spectral characterization of 4-rose graphs

A rose graph with p petals (or p-rose graph) is a graph obtained by taking p cycles with just a vertex in common. In this paper, we prove that all 4-rose graphs are determined by their signless Laplacian spectra.