Results 21 to 30 of about 2,374 (146)
Linear maps of positive partial transpose matrices and singular value inequalities
Linear maps Φ : Mn → Mk are called m -PPT if [Φ(Ai j)]i, j=1 are positive partial transpose matrices for all positive semi-definite matrices [Ai j]i, j=1 ∈ Mm(Mn) .
Xiaohui Fu, Pan-Shun Lau, T. Tam
semanticscholar +1 more source
On minimum algebraic connectivity of graphs whose complements are bicyclic
The second smallest eigenvalue of the Laplacian matrix of a graph (network) is called its algebraic connectivity which is used to diagnose Alzheimer’s disease, distinguish the group differences, measure the robustness, construct multiplex model ...
Liu Jia-Bao+3 more
doaj +1 more source
Cospectral constructions for several graph matrices using cousin vertices
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum.
Lorenzen Kate
doaj +1 more source
Characteristic polynomial, determinant and inverse of a Fibonacci-Sylvester-Kac matrix
In this paper, we consider a new Sylvester-Kac matrix, i.e., Fibonacci-Sylvester-Kac matrix. We discuss the eigenvalues, eigenvectors and characteristic polynomial of this matrix in two categories based on whether the Fibonacci-Sylvester-Kac matrix order
Jiang Zhaolin, Zheng Yanpeng, Li Tianzi
doaj +1 more source
BACKGROUND and aim: Macrolide antibiotics are widely used in the treatment of suppurative lung diseases including cystic fibrosis (CF), the most common inherited fatal disease in the Caucasian population. This condition is characterized by secondary Pseudomonas infection resulting in neutrophil infiltration within the airways.
Alexander L. Pukhalsky+5 more
wiley +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
Matrix Analysis for Continuous-Time Markov Chains
Continuous-time Markov chains have transition matrices that vary continuously in time. Classical theory of nonnegative matrices, M-matrices and matrix exponentials is used in the literature to study their dynamics, probability distributions and other ...
Le Hung V., Tsatsomeros M. J.
doaj +1 more source
A note on the spectra of tridiagonal matrices
Using orthogonal polynomials, we give a different approach to some recent results on tridiagonal matrices.
C. M. da Fonseca, J. Petronilho
wiley +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
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