Results 21 to 30 of about 1,573,587 (265)
The symmetric inverse M-matrix completion problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Johnson, Charles R., Smith, Ronald L.
openaire +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
doaj +1 more source
M-matrix generalized inverses of M-matrices
The condition when the group inverse of the associated singular irreducible \(M\)-matrix corresponding to a nonnegative, irreducible and stochastic matrix will be an \(M\)-matrix is that this matrix lies in a small wedge about a rank one nonnegative matrix.
Chen, Yonghong, Neumann, M.
openaire +2 more sources
The M-matrix group inverse problem for distance-biregular graphs
AbstractIn this work, we obtain the group inverse of the combinatorial Laplacian matrix of distance-biregular graphs. This expression can be obtained trough the so-called equilibrium measures for sets obtained by deleting a vertex. Moreover, we show that the two equilibrium arrays characterizing distance-biregular graphs can be expressed in terms of ...
Abiad Monge, Aida +3 more
openaire +3 more sources
Square matrices with the inverse diagonal property
We identify the class of real square invertible matrices A for which the signs of the diagonal entries of A−1 match those of A, and begin their study. We say such matrices have the inverse diagonal property (IDP).
Susana Furtado +3 more
doaj +1 more source
Confinement/deconfinement transition in the D0-brane matrix model — A signature of M-theory?
We study the confinement/deconfinement transition in the D0-brane matrix model (often called the BFSS matrix model) and its one-parameter deformation (the BMN matrix model) numerically by lattice Monte Carlo simulations.
Monte Carlo String/M-theory collaboration (MCSMC) +8 more
doaj +1 more source
Sign determinacy of M-matrix minors
Let A be a (singular or non-singular) M-matrix, and let G(A) denote its undirected graph. The main result is that if the longest simple cycle of G(A) has length not exceeding 3 then the sign of any minor of A depends only on G(A) and not on the magnitude of the entries of A.
Johnson, Charles R. +3 more
openaire +2 more sources
Several new inequalities for the minimum eigenvalue of M-matrices
Several convergent sequences of the lower bounds for the minimum eigenvalue of M-matrices are given. It is proved that these sequences are monotone increasing and improve some existing results.
Jianxing Zhao, Caili Sang
doaj +1 more source
A Graph Classification Method Based on Support Vector Machines and Locality-Sensitive Hashing
Graphs classification is a relevant problem that arises in many disciplines. Using graphs directly instead of vectorization allows exploiting the intrinsic representations of the data.
Maria D. Gonzalez-Lima +2 more
doaj +1 more source
Completions of M-matrix patterns
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

