We present a model and propose an approach to compute an approximate solution of Fully Fuzzy Linear System $(FFLS)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. First, in discussing an $FFLS$ with a nonnegative coefficient matrix, we consider an equivalent $FFLS$ by using an appropriate permutation to simplify fuzzy multiplications. T...

We study the quadratic matrix equation X2 − EX − F = 0, where E is diagonal and F is an M -matrix. Quadratic matrix equations of this type arise in noisy Wiener–Hopf problems for Markov chains. The solution of practical interest is a particular M -matrix solution. The existence and uniqueness of M -matrix solutions and numerical methods for finding the desired M -matrix solution are discussed b...

 Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...

it is necessary to generate the automorphism group of a chemical graph in computer-aidedstructure elucidation. an euclidean graph associated with a molecule is defined by a weightedgraph with adjacency matrix m = [dij], where for i≠j, dij is the euclidean distance between thenuclei i and j. in this matrix dii can be taken as zero if all the nuclei are equivalent. otherwise,one may introduce dif...