منابع مشابه
Nonnegative Matrices
For a loopless, acyclic, transitive directed graph S, we study the relations between the predecessor property and the well structured property on S. These properties assure the existence of nonnegativ€ Jordan bases for any nonnegative matrix with singular graph S.
متن کاملF-Permutations induce Some Graphs and Matrices
In this paper, by using the notion of fuzzy subsets, the concept of F-permutation is introduced. Then by applying this notion the concepts of presentation of an F-polygroup, graph of an F-permutation and F-permutation matrices are investigated.
متن کاملNonnegative signed total Roman domination in graphs
Let $G$ be a finite and simple graph with vertex set $V(G)$. A nonnegative signed total Roman dominating function (NNSTRDF) on a graph $G$ is a function $f:V(G)rightarrow{-1, 1, 2}$ satisfying the conditionsthat (i) $sum_{xin N(v)}f(x)ge 0$ for each $vin V(G)$, where $N(v)$ is the open neighborhood of $v$, and (ii) every vertex $u$ for which $f(u...
متن کاملMonotonicity of Nonnegative Matrices
We present a nonnegative rank factorization of a nonnegative matrix A for the case in which one or both of A(1)A and AA(1) are nonnegative. This gives, in particular, a known result for characterizing nonnegative matrices when A†A or AA† is nonnegative. We applied this characterization to the derivation of known results based on the characterization of nonnegative monotone matrices. A matrix A ...
متن کاملWhich Nonnegative Matrices Are Slack Matrices?
In this paper we characterize the slack matrices of cones and polytopes among all nonnegative matrices. This leads to an algorithm for deciding whether a given matrix is a slack matrix. The underlying decision problem is equivalent to the polyhedral verification problem whose complexity is unknown.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1972
ISSN: 0024-3795
DOI: 10.1016/0024-3795(72)90009-2