Results 61 to 70 of about 2,183 (141)
A Geršgorin-type eigenvalue localization set with n parameters for stochastic matrices
A set in the complex plane which involves n parameters in [0, 1] is given to localize all eigenvalues different from 1 for stochastic matrices. As an application of this set, an upper bound for the moduli of the subdominant eigenvalues of a stochastic ...
Wang Xiaoxiao, Li Chaoqian, Li Yaotang
doaj +1 more source
Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem.
Zhao Jianxing, Sang Caili
doaj +1 more source
On a graph of monogenic semigroups
Let us consider the finite monogenic semigroup SM with zero having elements {x,x2,x3,…,xn}. There exists an undirected graph Γ(SM) associated with SM whose vertices are the non-zero elements x,x2,x3,…,xn and, f or 1≤i,j≤n, any two distinct vertices xi ...
K. Das, Nihat Akgüneş, A. Cevik
semanticscholar +1 more source
We take as given a real symmetric matrix A, whose graph is a tree T, and the eigenvalues of A, with their multiplicities. Each edge of T may then be classified in one of four categories, based upon the change in multiplicity of a particular eigenvalue ...
Toyonaga Kenji, Johnson Charles R.
doaj +1 more source
Fuzzy Integral domains and Fuzzy regular sequences
In this paper, the notions of fuzzy zero-divisors and fuzzy integral domains are illustrated. Some fundamental properties of fuzzy integral domains are proved. Moreover, the notions of fuzzy regular element and fuzzy regular sequences are defined.
Saba Ayub, Waqas Mahmood
semanticscholar +1 more source
Fractional Revival of Threshold Graphs Under Laplacian Dynamics
We consider Laplacian fractional revival between two vertices of a graph X. Assume that it occurs at time τ between vertices 1 and 2. We prove that for the spectral decomposition L=∑r=0qθrErL = \sum\nolimits_{r = 0}^q {{\theta _r}{E_r}} of the Laplacian
Kirkland Steve, Zhang Xiaohong
doaj +1 more source
The non-negative spectrum of a digraph
Given the adjacency matrix A of a digraph, the eigenvalues of the matrix AAT constitute the so-called non-negative spectrum of this digraph. We investigate the relation between the structure of digraphs and their non-negative spectra and associated ...
Alomari Omar +2 more
doaj +1 more source
New sharp bounds for logarithmic mean and identric mean
For x,y>0 with x≠y, let L=L(x,y), I=I(x,y), A=A(x,y), G=G(x,y), Ar=A1/r(xr,yr) denote the logarithmic mean, identric mean, arithmetic mean, geometric mean and r-order power mean, respectively. We find the best constant p,q>0 such that the inequalities
Zhen-Hang Yang
semanticscholar +1 more source
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen.
Adm Mohammad +5 more
doaj +1 more source
On differentiability of a class of orthogonally invariant functions on several operator variables
In this work, we study a connection between two classes of orthogonally invariant functions. Both types of functions are defined on Sn1 × . . .× Snk . The functions in the first class take their values in Sn1 ···nk , while those in the second take values
T. Jiang, Hristo S. Sendov
semanticscholar +1 more source

