Results 51 to 60 of about 1,935 (133)
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 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
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
A convergence analysis of SOR iterative methods for linear systems with weak H-matrices
It is well known that SOR iterative methods are convergent for linear systems, whose coefficient matrices are strictly or irreducibly diagonally dominant matrices and strong H-matrices (whose comparison matrices are nonsingular M-matrices).
Zhang Cheng-yi +2 more
doaj +1 more source
Bound for the largest singular value of nonnegative rectangular tensors
In this paper, we give a new bound for the largest singular value of nonnegative rectangular tensors when m = n, which is tighter than the bound provided by Yang and Yang in “Singular values of nonnegative rectangular tensors”, Front. Math.
He Jun +4 more
doaj +1 more source
Two new eigenvalue localization sets for tensors and theirs applications
A new eigenvalue localization set for tensors is given and proved to be tighter than those presented by Qi (J. Symbolic Comput., 2005, 40, 1302-1324) and Li et al. (Numer. Linear Algebra Appl., 2014, 21, 39-50).
Zhao Jianxing, Sang Caili
doaj +1 more source
Potential counter-examples to a conjecture on the column space of the adjacency matrix
Attempts to resolve the Akbari-Cameron-Khosrovshahi-conjecture have so far focused on the rank of a matrix. The conjecture claims that there exists a nonzero (0, 1)-vector in the row space of a (0, 1)-adjacency matrix A{\bf{A}} of a graph GG, that is not
Sciriha Irene +3 more
doaj +1 more source
Some stable and closed-shell structures of anticancer drugs by graph theoretical parameters. [PDF]
Koam ANA +4 more
europepmc +1 more source
In this article, we are interested in the standard finite element approximation method of linear additive Schwarz iterations for a class of semi-linear elliptic problems, for two subdomains, in the context of non-matching grids.
Al Farei Qais, Boulbrachene Messaoud
doaj +1 more source

