T-型树谱唯一性的一个简单刻画

图G称为谱唯一的,如果任何与G谱相同的图一定与G同构.一棵树称为T-型树如果其仅有一个最大度为3的顶点.本文给出了T-型树谱唯一性的一个简单刻画,从而完全解决了T-型树的谱唯一性问题.     

T-型树T(1,l,m)可由其谱唯一决定

一棵树称为T-型树,如果其恰有一个最大度为3的顶点.令T(l1,l2,l3)表示唯一的一棵T-型树,使得其3-度顶点到每个1-度顶点的距离分别为l1,l2,l3.本文证明T(1,l,m)(l,m≥1)可由其相邻谱唯一决定.     

关于k树的谱半径

洪渊给出了谱半径最大的k树.该文进一步定义了关于k树的一个参数l(G),借之给出了谱半径达到第二大和第三大的k树.     

具有固定直径的树的拉普拉斯谱半径

一个图称为毛毛虫,如果从它删去所有的悬挂点后得到的图是一个路.研究了具有固定直径的毛毛虫树的拉普拉斯谱半径,确定了其中具有最大拉普拉斯谱半径的毛毛虫树并且讨论了该树的一些性质.     

树指标m重Markov链转移矩阵的一个强极限定理

树模型近年来已引起物理学、概率论及信息论界的广泛兴趣.树指标随机过程已成为近年来发展起来的概率论的研究方向之一.在概率论的发展过程中,对强极限定理的研究一直占重要地位,强极限定理也一直是国际概率论界研究的中心课题之一.本文通过构造非负鞅,利用鞅论研究给出了非齐次树指标m重连续状态马氏链转移矩阵的一个强极限定理.     

非负矩阵与有向图的谱半径

本文给出非负矩阵的谱半径的上界、下界,由此给出有向图的谱半径的界.     

一致超图谱半径界的改进结果

利用张量理论研究一致超图的谱半径.首先,利用对角相似张量与原张量同谱的性质,结合张量特征值的圆盘定理,给出谱半径的上界,这一上界严格小于最大度;其次,通过超图的度向量给出谱半径的下界.改进了超图谱半径上下界的原有结果.     

直径为n-4的图的最小无号拉普拉斯谱半径

Liu Lu和Shu等在[The minimal Lapacian spectral radius of trees with a given diameter,Theoretical Computer Science,2009,410:78-83]中分别给出了直径为{1,2,3,4,n-3,n-2,n-1}的具有最小拉普拉斯谱半径的树.本文给出了直径为n-4的具有最小无号拉普拉斯谱半径的图.作为推论,给出了直径为n-4的具有最小拉普拉斯谱半径的村.     

关于非齐次树上m重连续状态马氏链的一个强大数定律

强大数定律一直是国际概率论界研究的中心课题之一.通过构造适当的非负鞅,将Doob鞅收敛定理应用于几乎处处收敛的研究,研究给出了一个关于树指标m重连续状态马氏链的强大数定律.     

树指标m重非齐次马氏信源的一个强大数定律

树指标随机过程已成为近年来发展起来的概率论的研究方向之一.在概率论的发展过程中,对强大数定律的研究一直占重要地位,强大数定律也一直是国际概率论界研究的中心课题之一.将经典的一重非齐次马氏信源上的强大数定律推广到树指标m重非齐次马氏信源上,以拓展强大数定律的适用范围.通过引入相对熵密度偏差的概念和构造非负鞅,将Doob鞅收敛定理应用于几乎处处收敛的研究,研究给出了关于树上m重非齐次马氏信源的一个强大数定律.     

Uniform supertrees with extremal spectral radii

A supertree is a connected and acyclic hypergraph. We investigate the supertrees with the extremal spectral radii among several kinds of r-uniform supertrees. First, by using the matching polynomials of supertrees, a new and useful grafting operation is proposed for comparing the spectral radii of supertrees, and its applications are shown to obtain the supertrees with the extremal spectral radii among some kinds of r-uniform supertrees. Second, the supertree with the third smallest spectral radius among the r-uniform supertrees is deduced. Third, among the r-uniform supertrees with a given maximum degree, the supertree with the smallest spectral radius is derived. At last, among the r-uniform starlike supertrees, the supertrees with the smallest and the largest spectral radii are characterized.     

Distortion theorems for subclasses of starlike mappings along a unit direction in ℂ

In this paper, we obtain a distortion theorem of Jacobian matrix for biholomorphic subclasses of starlike mappings along a unit direction on the unit polydisc. These results extend the classical distortion theorem of starlike mappings to higher dimensions. We then give an upper bound estimate for biholomorphic subclasses of starlike mappings along a unit direction in a complex Banach space.     

谱半径前五位的$n$阶拟树图

A connected graph G =(V, E) is called a quasi-tree graph, if there exists a vertex v_0 ∈ V(G) such that G-v_0 is a tree. Liu and Lu [Linear Algebra Appl. 428(2008) 2708-2714] determined the maximal spectral radius together with the corresponding graph among all quasi-tree graphs on n vertices. In this paper, we extend their result, and determine the second to the fifth largest spectral radii together with the corresponding graphs among all quasi-tree graphs on n vertices.     

Some results on symmetric double starlike trees

A tree is called starlike if it has exactly one vertex of degree greater than two. In [2] it was proved that two starlike trees are cospectral if and only if they are isomorphic. A tree is called double starlike if it has exactly two adjacent vertices of degree greater than two. We prove here that there exist no two cospectral non-isomorphic symmetric double starlike trees.     

Spectral characterization of line graphs of starlike trees

Two graphs are said to be A-cospectral if they have the same adjacency spectrum. A graph G is said to be determined by its adjacency spectrum if there is no other non-isomorphic graph A-cospectral with G. A tree is called starlike if it has exactly one vertex of degree greater than 2. In this article, we prove that the line graphs of starlike trees with maximum degree at least 12 are determined by their adjacency spectra.     

On the eigenvalues and spectral radius of starlike trees

Let \(k\ge 1\) and \(n_1,\ldots ,n_k\ge 1\) be some integers. Let \(S(n_1,\ldots ,n_k)\) be a tree T such that T has a vertex v of degree k and \(T{\setminus } v\) is the disjoint union of the paths \(P_{n_1},\ldots ,P_{n_k}\), that is \(T{\setminus } v\cong P_{n_1}\cup \cdots \cup P_{n_k}\) so that every neighbor of v in T has degree one or two. The tree \(S(n_1,\ldots ,n_k)\) is called starlike tree, a tree with exactly one vertex of degree greater than two, if \(k\ge 3\). In this paper we obtain the eigenvalues of starlike trees. We find some bounds for the largest eigenvalue (for the spectral radius) of starlike trees. In particular we prove that if \(k\ge 4\) and \(n_1,\ldots ,n_k\ge 2\), then \(\frac{k-1}{\sqrt{k-2}}<\lambda _1(S(n_1,\ldots ,n_k))<\frac{k}{\sqrt{k-1}}\), where \(\lambda _1(T)\) is the largest eigenvalue of T. Finally we characterize all starlike trees that all of whose eigenvalues are in the interval \((-2,2)\).     

Dimension pure globale des anneaux commutatifs

For every (n,m) ? IN^?× IN ^?, verifying l We study direct systems of rings and give a bound for the pure - global - dimension of their limits, not depending on the ring cardinality. Using this result and a theorem of C0UCH0T we give examples of pure -heriditary group- rings (ie. of pure -global - dimension one) of large cardinality.

Finaly we prove - using a result of VASC0NCEL0S and a theorem of JENSEN - that some countably products of noetherian rings are coherent rings and that their pure - global - dimension is exactly two.     

可修复人机系统的指数稳定性

研究了两相同部件温储备可修的人机系统,运用C_0半群的相关理论,对系统主算子的谱界进行估值.估算系统的算子产生的半群的增长界,然后运用了共尾的概念及相关的理论,得到了系统算子A+B的谱界与系统算子产生的半群的增长界相同.进而运用相关代数知识证得,0为系统算子的简单本征值,并分析了系统算子的谱分布,得到系统的指数稳定性.并研究了系统算子预解式的特性.对任意给定的δ0,γ=a+bi,-μ+δa_1≤a≤a_2,得到lim|b|→∞‖R(γ;A+B)‖=0.进而得到在~sRγ≥a_1的右半平面内相应于系统算子A+B的谱点由有限个本征值组成.     

On the Laplacian spectral characterization of Π-shape trees

A Π-shape tree is a tree with exactly two vertices having the maximum degree three. In this paper, we classify the Π-shape trees into two types, and complete the spectral characterization for one type. Exactly, we prove that all graphs of this type are determined by their Laplacian spectra with some exceptions. Moreover, we give some L-cospectral mates of some graphs for another type.     

Some results on the ordering of the Laplacian spectral radii of unicyclic graphs

A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo Shu-Guang [S.G. Guo, The largest Laplacian spectral radius of unicyclic graph, Appl. Math. J. Chinese Univ. Ser. A. 16 (2) (2001) 131–135] determined the first four largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices. In this paper, we extend this ordering by determining the fifth to the ninth largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices.