共查询到20条相似文献,搜索用时 78 毫秒
1.
Laplacian spread的概念在刻画图的整体性质方面非常重要.近年来,Fan等分别刻画了树中具有极大和极小Laplacian spread的图.另外Bao等确定了在所有单圈图中具有极大Laplacian spread的图.边数减去顶点数目为1的连通图称为双圈图.令B_n是所有有n个顶点构成的双圈图集合.对n≥11,本文确定了B_n中所有具有极大Laplacian spread的那些图. 相似文献
2.
3.
4.
讨论了“哪些图由它的Laplacian谱确定?”的问题,一棵树称为F型树,如果其由一梳图的一个2度顶点与一条路的悬挂点邻接而成。本文利用同谱图的线图的特点,证明了,型树可由它的Laplacian谱确定。 相似文献
5.
童裕孙 《数学物理学报(A辑)》1998,18(2):176-183
该文在加权L2空间上讨论Laplacian的一类扰动,得到了它在Friedrich扩张下定义域的刻划,并在适当的条件下证明了这个算子没有正的特征值. 相似文献
6.
设G=(V(G),E(G))是一个简单连通图,V(G),E(G)分别表示图G的顶点集和边集.如果与图G同Laplacian谱的图都与G同构,则称图G由它的Laplacian谱确定.该文定义了两类双圈图Q(n;n_1,n_2,···,nt)和B(n;n_1,n_2),证明了双圈图Q(n;n_1),Q(n;n_1,n_2),Q(n;n_1,n_2,n_3)和双圈图B(n;n_1,n_2)分别由它们的Laplacian谱确定. 相似文献
7.
本和用活动标架法及Laplacian特征值方法研究了空间形中具有常数平均曲率的子流形,给出了高斯曲率与数量曲率的一种估计方法,证明了空间形中具有常数平均曲率的子流形上一个单连通有界区域为稳定的两个充分条件。 相似文献
8.
得到了给定顶点数和边独立数的树与单圈图的Laplacian矩阵的最大特征值的精确上界,并且给出了达到上界的所有极图. 相似文献
9.
树的最大特征值的上界的一个注记 总被引:2,自引:2,他引:0
设T是一个树,V是T的顶点集.记dv是υ∈V的度,△是T的最大顶点度.设υ∈V且dw=1.记k=ew+1,这里ew是w的excentricity.设δj′= max{dυ:dist(υ,w)=j},j=1,2,…,k-2,我们证明和这里μ1(T)和λ1(T)分别是T的Laplacian矩阵和邻接矩阵的最大特征值.特别地,记δo′=2. 相似文献
10.
紧致流形上Laplacian的第一特征值的下界估计一直以来是人们非常感兴趣的问题之一.本文在整体曲率Pinching较小的条件之下考虑这个问题,得到了相应几何条件之下的Laplacian第一特征值的一个下界估计. 相似文献
11.
12.
The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results. 相似文献
13.
Hajime Urakawa 《Geometriae Dedicata》1999,74(1):95-112
We give a graph theoretic analogue of Cheng's eigenvalue comparison theorems for the Laplacian of complete Riemannian manifolds. As its applications, we determine the infimum of the (essential) spectrum of the discrete Laplacian for infinite graphs. 相似文献
14.
《Discrete Mathematics》2019,342(12):111607
We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound. 相似文献
15.
Li Jiayu 《偏微分方程(英文版)》1992,5(4)
Let M be an n-dimensional noncompact complete Riemannian manifold, "Δ" is the Laplacian of M. It is a negative selfadjoint operator in L²(M). First, we give a criterion of non-existence of eigenvalue by the heat kernel. Applying the criterion yields that the Laplacian on noncompact constant curvature space form has no eigenvalue. Then, we give a geometric condition of M under which the Laplacian of M has eigenvalues. It implies that changing the metric on a compact domain of constant negative curvature space form may yield eigenvalues. 相似文献
16.
Trees are very common in the theory and applications of combinatorics. In this article, we consider graphs whose underlying structure is a tree, except that its vertices are graphs in their own right and where adjacent graphs (vertices) are linked by taking their join. We study the spectral properties of the Laplacian matrices of such graphs. It turns out that in order to capture known spectral properties of the Laplacian matrices of trees, it is necessary to consider the Laplacians of vertex-weighted graphs. We focus on the second smallest eigenvalue of such Laplacians and on the properties of their corresponding eigenvector. We characterize the second smallest eigenvalue in terms of the Perron branches of a tree. Finally, we show that our results are applicable to advancing the solution to the problem of whether there exists a graph on n vertices whose Laplacian has the integer eigenvalues 0, 1, …, n ? 1. 相似文献
17.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
18.
Kinkar Ch. Das 《Linear and Multilinear Algebra》2013,61(6):441-460
In this article, we present lower bounds for the largest eigenvalue, the second largest eigenvalue and the sum of the two largest eigenvalues of the Laplacian matrix of a graph. 相似文献
19.
Kinkar Ch. Das 《Linear and Multilinear Algebra》2004,52(6):441-460
In this article, we present lower bounds for the largest eigenvalue, the second largest eigenvalue and the sum of the two largest eigenvalues of the Laplacian matrix of a graph. 相似文献
20.
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. 相似文献