1) Laplacian spectral radius
Laplacian谱半径
1.
Let ρ(G) and μ(G) be the adjacency spectral radius and the Laplacian spectral radius respectively.
设G为n阶连通的简单图 ,ρ(G)为图G的邻接谱半径 ,μ(G)表示G的Laplacian谱半径。
2.
Let du and mu the degree and 2-degree of the vertex u,respectively,λ1(G) denote the Laplacian spectral radius of G.
设G为n阶简单连通图,V(G)为图G的顶点集,E(G)为图G的边集,λ1(G)是Laplacian谱半径,du,mu分别表示顶点u的度和平均2次度。
2) Laplacian spectra
Laplacian谱
1.
Based on Laplacian spectra theory,the formulae are obtained for computing Kirchhoff index of a special class of chord graphs Gp(r,t),which constructed from a series of complete graphs by pasting them in a certain way.
根据图的Laplacian谱理论,得到了由p个完全图按特定方式粘贴构造而成的一类弦图Gp(r,t)的Kirchhoff指标的计算公式。
2.
In this paper,by using the properties of cospectral graphs,it is proved that the F-shape tree is uniquely determined by its Laplacian spectra.
讨论了"哪些图由它的Laplacian谱确定?"的问题。
3.
In this paper,by Laplacian spectra theory,formulae for computing Kirchhoff index of three special classes of chord graphs constructed from a series of complete graphs by pasting them in some certain ways are obtained.
根据图的Laplacian谱理论,得到了由一些完全图按特定方式粘贴构造而成的三类弦图的Kirchhoff指标的计算公式。
3) Laplacian spectrum
Laplacian谱
1.
Double-starlike tree H_n(p,2) determined by its Laplacian spectrum;
似双星树H_n(p,2)由它的Laplacian谱确定
2.
Problem of determination of Laplacian spectrum of multi-fan graph;
多扇图的Laplacian谱确定问题
3.
The graph W is determined by its Laplacian spectrum
图W由它的Laplacian谱确定
4) Laplacian spectral radius
Laplace谱半径
1.
In this note,the relations between the covering number of graph and the Laplacian spectral radius are investigated.
本文讨论图的点覆盖数与图的 Laplace谱半径的关系 ,利用特征向量的技巧得到由图的 L aplace谱半径所确定的关于图的点覆盖数的紧的
2.
B),2004,19(2): 140-148],the authors prove that up to signature isomorphisms U* is the unique graph which maximizes Laplacian spectral radius over all unicyclic mixed graphs on n vertices.
B),2004,19(2):140-148]中,作者证明了:在相差符号同构意下,在所有n个顶点上的单圈混合图中,U*是唯一的达到最大Laplace谱半径的混合图。
3.
In this thesis,we consider the extremal graphs about Laplacian spectral radius of bipartite graphs with k cut edges,bicyclic bipartite graphs,unicyclic graphs with fixed diameters,unicyclic graphs with k pendent edges;some graphs determined by their spectra;cospectral graphs;minimal distance spectral radius.
本论文主要研究了有k条割边的二部图,双圈二部图,有固定直径的单圈图以及有k条悬挂边的单圈图关于Laplace谱半径的极值图:由谱决定的一些图;同谱图;最小距离谱半径。
5) Spectral radius
谱半径
1.
On the new upper bounds of spectral radius of trees given edge independence number;
给定边独立数的树的谱半径的新上界
2.
The spectral radius of a graph and upper bounds on sum of the spectral radius of a graph and its complement;
图的谱半径及图与补图谱半径和的上界
3.
A generalization of Ostrowski s and Brauer s theorems on a class of matrices and the spectral radius of a bipartite tournament matrix;
圆盘定理的推广与二部竞赛矩阵谱半径
6) radius of spectral field
谱域半径
补充资料：谱半径
谱半径
spectral radius
谱半径【sPeetrai radjus;cneKTp叨‘“.p叭“yc]，致川ach代数的元素的 包含这元素的谱的平面上最小闭圆盘的半径p(见元素的谱(spectnlln of ane城拙nt)).一个元素a的谱半径由公式 p(a)一。呱}la”}}’‘”=inf!{a”}}’‘·与其幂的范数相联系，特别地上式蕴涵p(a)‘}}aJ}.Banach空间上一个有界线性算子的谱半径是它作为所有算子的Banach代数的一个元素的谱半径、在Hil-bert空间中一个算子的谱半径等于相似于它的算子的范数中的最大下界(见tZI): “(A)一梦“XAX一‘“·如果该算子是正规的，则p(A)二“A“(见正规算子(norn班1 operator)). 作为BanaCh代数的元素的一个函数，谱半径是上半连续的(但一般不连续).谱半径的下调和性已被证明(t3]).(这就是指如果之”h(:)是某区域D CC到B队业ch代数吸中的一个全纯映射，则zl~刀(h(z))是T调和函数(subha口叩nic functio们).)
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条