共查询到19条相似文献,搜索用时 62 毫秒
1.
2.
利用张量理论研究一致超图的谱半径.首先,利用对角相似张量与原张量同谱的性质,结合张量特征值的圆盘定理,给出谱半径的上界,这一上界严格小于最大度;其次,通过超图的度向量给出谱半径的下界.改进了超图谱半径上下界的原有结果. 相似文献
3.
用代数方法给出了一个关于简单图的顶点度数与拟拉普拉斯谱半径的不等式,并给出了图的拟拉普拉斯谱半径的一个新上界. 相似文献
4.
5.
研究了单圈图的无号拉普拉斯谱半径,给出了具有固定围长的单圈图的无号拉普拉斯谱半径最大的图. 相似文献
6.
7.
本文刻画取得给定阶数和独立数连通图的谱半径最大值的图的结构,对特殊独立数也给出取得最小谱半径图的结构. 相似文献
8.
9.
10.
柳柏濂 《数学物理学报(A辑)》2009,29(2):233-238
讨论了由D.Stevanovi′c提出的给定顶点数n 和最大度?的非正则图的谱半径的上界,并给出了一些新的由?表示的谱半径的界. 相似文献
11.
We obtain a sharp upper bound for the spectral radius of a nonnegative matrix. This result is used to present upper bounds for the adjacency spectral radius, the Laplacian spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance Laplacian spectral radius, the distance signless Laplacian spectral radius of an undirected graph or a digraph. These results are new or generalize some known results. 相似文献
12.
In this paper, we obtain the sharp upper and lower bounds for the spectral radius of a nonnegative irreducible matrix. We also apply these bounds to various matrices associated with a graph or a digraph, obtain some new results or known results about various spectral radii, including the adjacency spectral radius, the signless Laplacian spectral radius, the distance spectral radius, the distance signless Laplacian spectral radius of a graph or a digraph. 相似文献
13.
Ji-ming Guo 《应用数学学报(英文版)》2008,24(2):289-296
In this paper, sharp upper bounds for the Laplacian spectral radius and the spectral radius of graphs are given, respectively. We show that some known bounds can be obtained from our bounds. For a bipartite graph G, we also present sharp lower bounds for the Laplacian spectral radius and the spectral radius, respectively. 相似文献
14.
Qiannan Zhou 《Linear and Multilinear Algebra》2017,65(2):224-234
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. 相似文献
15.
令G是一个简单连通图,ρ(G)和q~D(G)分别为图G的邻接谱半径和距离无符号拉普拉斯谱半径.提供了图G是哈密顿连通的两个新的谱充分条件,这两个充分条件分别是以ρ(G)和q~D(G)表示的,其中G是G的补图.进一步地,还给出了以q~D(G)表示的图G是从任意一点出发都是可迹的新的谱充分条件,从而扩展和改进了文献中的结果. 相似文献
16.
The weighted graphs, where the edge weights are positive numbers, are considered. The authors obtain some lower bounds on the spectral radius and the Laplacian spectral radius of weighted graphs, and characterize the graphs for which the bounds are attained. Moreover, some known lower bounds on the spectral radius and the Laplacian spectral radius of unweighted graphs can be deduced from the bounds. 相似文献
17.
Irina Ignatiouk-Robert 《Probability Theory and Related Fields》2006,134(1):44-80
The essential spectral radius of a sub-Markovian process is defined as the infimum of the spectral radiuses of all local perturbations
of the process. When the family of rescaled processes satisfies sample path large deviation principle, the spectral radius
and the essential spectral radius are expressed in terms of the rate function. The paper is motivated by applications to reflected
diffusions and jump Markov processes describing stochastic networks for which the sample path large deviation principle has
been established and the rate function has been identified while essential spectral radius has not been calculated. 相似文献
18.
19.
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. 相似文献