[PDF] Top 20 vol20_pp436-448. 146KB Jun 04 2011 12:06:08 AM

... The study of algebraic curvature tensors has been approached in several ways. For instance, B. Fiedler [7] investigated A(V ) using methods from algebraic combinatorics, and later used group representation theory to ... Lihat dokumen lengkap

... In the following theorem by using the previous facts we show that only graphs of typeT44and disjoint union ofT45 with one path can be cospectral to a given starlike tree with maximum de[r] ... Lihat dokumen lengkap

... On the other hand, by Theorem 3.5, we cannot generate means whose isotropy group contains An−1 by composition of simpler means; therefore, there is no simpler approach than that of build[r] ... Lihat dokumen lengkap

... Applications of the Drazin inverse to singular differential equations and singular difference equations, to Markov chains and iterative methods, to structured matrices, and to perturbati[r] ... Lihat dokumen lengkap

... By Fact 2, we haveNGu0⊆NGu1, and since there does not exist an internal path ofG−T with length greater than 1 unless the paths lies on a cycle of length 3.. So we can obtainu0u1∈EG.[r] ... Lihat dokumen lengkap

... A special quadratic 3×3 matrix The main purpose of this note is to deal with the behavior of the q-numerical ranges of some 3×3 tridiagonal matrices A that interpolate between the circu[r] ... Lihat dokumen lengkap

... 1. Introduction. The joint spectral radius has drawn much attention lately, see, for example, [1, 2, 3, 4, 5, 6, 7, 9, 13, 18] and the references therein, due to its applications in various areas such as switched systems ... Lihat dokumen lengkap

... If S is a regular spread of the projective space PG2t−1,F, then there exists a quadratic extensionF′ of F such that the following holds if we regard PG2t−1,F as a Baer-F -subgeometry of[r] ... Lihat dokumen lengkap

... We give a necessary and sufficient condition for a graph to be bipartite in terms of an eigenvector corresponding to the largest eigenvalue of the adjacency matrix of the graph.. Graph,[r] ... Lihat dokumen lengkap

... 4. Robust spectrum localization. In applications, the robust stability and the robust spectrum localization problems formulated for dynamic systems with para- metric uncertainty are very important (see, for example, ... Lihat dokumen lengkap

... It is a convex compact set of the complex plane which contains the spectrum of A. It is also called the field of values; see [8, Chapter 1] and [12, Chapter 1] for elementary introductions. Matlab functions for ... Lihat dokumen lengkap

... where Q ≥ 0, R > 0. The CARE has a maximal positive semidefinite solution K, which is the solution of practical interest (see Theorem 9.4.4 in Lancaster and Rodman [1]). Various bounds for this solution have been ... Lihat dokumen lengkap

... The literature on perturbations of matrix valued functions is very rich but mainly, perturbations of matrix functions of a complex argument and matrix functions of Hermitian matrices we[r] ... Lihat dokumen lengkap

... In Theorem 3.1, the spectral radius of the Jacobi iterative matrix may be es-timated using Lemma 2.3, but it is difficult for us to estimate the upper bound of diagonal elements ofA−1.. [r] ... Lihat dokumen lengkap

... Some results relating different matrix partial orderings and the reverse order law for the Moore-Penrose inverse and the group inverse are given.. Special attention is paid when at leas[r] ... Lihat dokumen lengkap

... These results are used to characterize all extremal weighted trees with the largestp-Laplacian spectral radius among all weighted trees with a given degree sequence and a positive weight[r] ... Lihat dokumen lengkap

... Here a converse statement is proved: If is an LCP-set with a continuous limit function then there exists a norm such that all matrices in are paracontracting with respect to this norm.. [r] ... Lihat dokumen lengkap

... The software includes basic tools to complete the following tasks: ·Definition and application of textures and materials that show reflections, bump maps, surface qualities and color ·[r] ... Lihat dokumen lengkap

... Our goal is to study the minimum semidefinite rank of all outerplanar graphs. Along these lines, it is known that the minimum semidefinite rank of trees on n vertices is n−1 (see [12]), and that for any unicyclic ... Lihat dokumen lengkap

... [4, Corollary 2.2]In any graph the multiplicity of the eigenvalue 0 of the signless Laplacian matrix is equal to the number of bipartite components... Also equality holds if and only if[r] ... Lihat dokumen lengkap