图的无符号拉普拉斯和距离无符号拉普拉斯特征值

Let G be a simple graph. We first show that ■, where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph, then some inequalities on the distance signless Laplacian eigenvalues are obtained by deleting some vertices and some edges from G. In addition, for the distance signless Laplacian spectral radius ρQ(G), we determine the extremal graphs with the minimum ρQ(G) among the trees with given diameter, the unicyclic and bicyclic graphs with given girth, respectively.     

On the numerical radius of Lipschitz operators in Banach spaces

We study the numerical radius of Lipschitz operators on Banach spaces via the Lipschitz numerical index, which is an analogue of the numerical index in Banach space theory. We give a characterization of the numerical radius and obtain a necessary and sufficient condition for Banach spaces to have Lipschitz numerical index 1. As an application, we show that real lush spaces and C  -rich subspaces have Lipschitz numerical index 1. Moreover, using the Gâteaux differentiability of Lipschitz operators, we characterize the Lipschitz numerical index of separable Banach spaces with the RNP. Finally, we prove that the Lipschitz numerical index has the stability properties for the _c0$c_0$-, _l1$l_1$-, and _l∞$l_{\infty }$-sums of spaces and vector-valued function spaces. From this, we show that the C(K)$C(K)$ spaces, _L1(μ)$L_1(\mu )$-spaces and _L∞(ν)$L_{\infty }(\nu )$-spaces have Lipschitz numerical index 1.     

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.     

矩阵Hadamard积和Fan积的特征值界的一些新估计式

本文研究了非奇异M-矩阵A与B的Fan积的最小特征值下界和非负矩阵A与B的Hadamard积 的谱半径上界的估计问题.利用Brauer定理,得到了一些只依赖于矩阵的元素且易于计算的新估计式,改进 了文献[4]现有的一些结果.     

S(Hn)上的满数值半径等距

本文研究了矩阵空间到自身的满数值半径等距问题. 利用等距嵌入方法, 获得了自共轭矩阵空间单位球面到自身的满数值半径等距可实线性延拓至全空间上的满数值半径等距, 为Tingley等距延拓问题提供了一种方法.     

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.     

On rotationally starlike logharmonic mappings

This paper considers the class of all mappings of the form where h and g are analytic in the unit disk U, normalized by , and such that is logharmonic with respect to an analytic self‐map a of U. A distortion estimate and the radius of starlikeness are obtained for this class. Additionally, a solution to the problem of minimizing the moments of order p over the class is found, as well as an estimate for arclength.     

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

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.     

Lower Bounds on the (Laplacian) Spectral Radius of Weighted Graphs

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.