首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
Elementary matrix-theoretic proofs are given for the following well-known results: r(D) = max{Re λ : λ an eigenvalue of A + D} and s(D) = lnρ(eDA) are convex. Here D is diagonal, A a nonnegative n × n matrix, and ρ the spectral radius.  相似文献   

3.
This paper analyzes the preservation of both the log convexity and the log concavity under certain Bernstein-type operators. Some results are provided for the Bernstein, Szász, Baskakov, the gamma-type and the Weierstrass operators. Probabilistic methods support the proofs of these results.  相似文献   

4.
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.  相似文献   

5.
6.
7.
8.
9.
In this note, we first extend and then give a related result to an inequality involing the spectral radius of nonnegative matrices that recently appcared in the literature.  相似文献   

10.
11.
《Optimization》2012,61(3-4):219-228
It was recently shown by Nikodem that a function defined on an open convex subset of R n is convex if and only if it is midpoint convex and quasiconvex. It is shown that quasiconvexity can be replaced by strict quasiconvexity and that the openness condition can be removed altogether. The domain can then be taken from a general real linear space. There will also be given some related results of a “local” nature  相似文献   

12.
In this paper we classify all real convexity theories that contain the standard convexity theory c. For this purpose we consider three subcases: finitary; infinitary and (sc\c)Ø; infinitary and sc=c. In each of these subcases one encounters a phenomenon resembling bifurcation.This research was supported by the Deutsche Forschungsgemeinschaft.  相似文献   

13.
14.
Let G=(V,E) be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius ρ(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, the following sharp bounds on ρ(G) have been obtained.min{ti+tj+:(vi,vj)E}?ρ(G)?max{ti+tj+:(vi,vj)E}where G is strongly connected and ti+ is the average 2-outdegree of vertex vi. Moreover, each equality holds if and only if G is average 2-outdegree regular or average 2-outdegree semiregular.  相似文献   

15.
16.
We provide explicit formulas for the joint spectral radius of certain classes of pairs of real matrices of order 2 with equal spectral radius.  相似文献   

17.
18.
Walks and the spectral radius of graphs   总被引:1,自引:0,他引:1  
Given a graph G, write μ(G) for the largest eigenvalue of its adjacency matrix, ω(G) for its clique number, and wk(G) for the number of its k-walks. We prove that the inequalities
  相似文献   

19.
This paper contains a connected account of results concerning the maximum problem raised by the first-named author in [21] and of its generalizations. For a number of results simplified proofs are given, new estimates are obtained, and important connections with stability theory and with classical function theory are pointed out.  相似文献   

20.
For linear inclusions in discrete or continuous time several quantities characterizing the growth behavior of the corresponding semigroup are analyzed. These quantities are the joint spectral radius, the initial growth rate and (for bounded semigroups) the transient bound. It is discussed how these constants relate to one another and how they are characterized by various norms. A complete duality theory is developed in this framework, relating semigroups and dual semigroups and extremal or transient norms with their respective dual norms.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号