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

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

New eigenvalue inclusion sets for tensors

Two new eigenvalue inclusion sets for tensors are established. It is proved that the new eigenvalue inclusion sets are tighter than that in Qi's paper “Eigenvalues of a real supersymmetric tensor”. As applications, upper bounds for the spectral radius of a nonnegative tensor are obtained, and it is proved that these upper bounds are sharper than that in Yang's paper “Further results for Perron–Frobenius theorem for nonnegative tensors”. And some sufficient conditions of the positive definiteness for an even‐order real supersymmetric tensor are given. Copyright © 2012 John Wiley & Sons, Ltd.     

The distance coloring of graphs

Let G be a connected graph with maximum degree Δ≥ 3.We investigate the upper bound for the chromatic number χγ(G) of the power graph Gγ.It was proved that χγ(G) ≤Δ(Δ-1)γ-1Δ-2+ 1 =:M + 1,where the equality holds if and only if G is a Moore graph.If G is not a Moore graph,and G satisfies one of the following conditions:(1) G is non-regular,(2) the girth g(G) ≤ 2γ- 1,(3)g(G) ≥ 2γ + 2,and the connectivity κ(G) ≥ 3 if γ≥ 3,κ(G) ≥ 4 but g(G) 6 if γ = 2,(4) Δis sufficiently larger than a given number only depending on γ,then χγ(G) ≤ M- 1.By means of the spectral radius λ1(G) of the adjacency matrix of G,it was shown that χ2(G) ≤λ1(G)2+ 1,where the equality holds if and only if G is a star or a Moore graph with diameter 2 and girth 5,and χγ(G)λ1(G)γ+1 ifγ≥3.     

给定围长的三圈图的无符号拉普拉斯谱半径

A tricyclic graph G =（V（G）, E（G）） is a connected and simple graph such that｜E（G）｜ = ｜V（G）｜＋2. Let Tg nbe the set of all tricyclic graphs on n vertices with girth g. In this paper, we will show that there exists the unique graph which has the largest signless Laplacian spectral radius among all tricyclic graphs with girth g containing exactly three（resp., four）cycles. And at the same time, we also give an upper bound of the signless Laplacian spectral radius and the extremal graph having the largest signless Laplacian spectral radius in Tg n,where g is even.     

A characterization of spaces of constant curvature by minimum covering radius of triangles

In this paper, we prove that if in a Riemannian manifold, the minimum covering radius of a point triple of small diameter depends only on the geodesic distances between the points, then the manifold must be of constant curvature. This implies that if in a complete connected Riemannian manifold, the volume of the intersection of three small geodesic balls of equal radii depends only on the distances between the centers and the radius, then it is one of the simply connected spaces of constant curvature. This generalizes an earlier result of the first author and D. Kunszenti-Kovács (2010).     

Theoretical analysis on capillary adhesion of microsized plates with a substrate

The stiction of a thin plate induced by the capillary force has attracted much attention in the broad range of applications. A novel method is presented to calculate the capillary adhesion problem of the plate through analytical method. The expressions of the surface energy, the strain energy and the total potential energy of the plate-substrate system have been analyzed and delineated. By means of continuum mechanics and the principle of minimum potential energy, the governing equation of the plate with an arbitrary shape and the corresponding transversality boundary condition due to the moving bound have been derived. Then the critical adhesion radius of the circular plate has been solved according to the supplementary transversality condition. Thus the deflections of the plates are analytically calculated with different critical adhesion radii. The results may be beneficial to the engineering application and the micro/nanomeasurement.     

On the spectral radius of a nonnegative centrosymmetric matrix

In this paper, we discuss the spectral radius of nonnegative centrosymmetric matrices. By using the centrosymmetric structure, we establish some estimations of the spectral radius.     

图与其补图谱半径之间关系的注记

给出在一般情形和某些限制条件下图及其补图的谱半径的和与积的上界，改进了文［１］的结果。     

基于遗传算法的静态Ad-hoc拓扑结构控制

将遗传算法引入到了静态Ad—hoc无线网络的拓扑结构控制中，突破了网络中所有节点辐射半径都相同的固有思路，通过调节各无线节点的辐射半径，在相邻节点对之间形成有向路径，从而达到节省节点能源消耗和网络拓扑结构优化的目的，并取得了较好的实验结果。