نتایج جستجو برای: sum eccentricity eigenvalues
تعداد نتایج: 101250 فیلتر نتایج به سال:
Chi-Kwong Li Department of Mathematics, College of William and Mary, Williamsburg, Virginia 23187-8795, USA E-mail: [email protected] We briefly describe some recent results on inequalities relating the eigenvalues of the sum of Hermitian or real matrices, and how to use these them inequalities relating the eigenvalues and singular values of a matrix and its submatrices. These results are joint ...
For a simple graph G, let e(G) denote the number of edges and Sk(G) denote the sum of the k largest eigenvalues of the signless Laplacian matrix of G. We conjecture that for any graph G with n vertices, Sk(G) ≤ e(G) + k+1 2 for k = 1, . . . , n. We prove the conjecture for k = 2 for any graph, and for all k for regular graphs. The conjecture is an analogous to a conjecture by A.E. Brouwer with ...
where the constant C depends on t, γ and d (see also [6] for the case when V is real). The paper [5] deals with the natural question that appears in relation to the main result of [3]: what estimates are valid for the eigenvalues situated inside the conical sector {λ : |Iλ| < tRλ}, where the eigenvalues might be close to the positive half-line? Theorems of the article [5] provide some informati...
We associate to any given circulant complex matrix C another one E(C) such that E(E(C)) = C∗ the transpose conjugate of C. All circulant Hadamard matrices of order 4 satisfy a condition C4 on their eigenvalues, namely, the absolute value of the sum of all eigenvalues is bounded above by 4. We prove by a “descent” that uses our operator E that the only circulant Hadamard matrices of order n > 4,...
The D-eigenvalues of a connected graph G are the eigenvalues of its distance matrix D, and form the D-spectrum of G. The D-energy ED(G) of the graph G is the sum of the absolute values of its D-eigenvalues. Two (connected) graphs are said to be D-equienergetic if they have equal D-energies. The D-spectra of some graphs and their D-energies are calculated. A pair of D-equienergetic bipartite gra...
Abstract: Let G = (VG, EG) be a simple connected graph. The eccentric distance sum of G is defined as ξ(G) = ∑ v∈VG εG(v)DG(v), where εG(v) is the eccentricity of the vertex v and DG(v) = ∑ u∈VG dG(u, v) is the sum of all distances from the vertex v. In this paper the tree among n-vertex trees with domination number γ having the minimal eccentric distance sum is determined and the tree among n-...
let $d$ be a digraph with skew-adjacency matrix $s(d)$. the skew energy of $d$ is defined as the sum of the norms of all eigenvalues of $s(d)$. two digraphs are said to be skew equienergetic if their skew energies are equal. we establish an expression for the characteristic polynomial of the skew adjacency matrix of the join of two digraphs, and for the respective skew energ...
We derive an elementary formula for the trace of a Hecke operator acting on a space of algebraic modular forms, as a sum of character values. We describe explicit computations in the case of the unitary group U(4), allowing the determination of the eigenvalues of a certain Hecke operator. This produces numerical evidence for a U(2, 2) analogue of Harder’s conjecture, on congruences between Heck...
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
We measured the relative contribution of rods and cones to luminance across a range of photopic, mesopic, and scotopic adaptation levels and at various retinal eccentricities. We isolated the luminance channel by setting motion-based luminance nulls (minimum motion photometry) using annular stimuli. Luminance nulls between differently colored stimuli require equality in a weighted sum of rod an...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید