in this paper, two sets of sufficient conditions are obtained to ensure the existence and stability of a unique equilibrium point of unforced first-order fuzzy relational dynamical systems by using two different approaches which are both based on the fuzzy relational matrix of the model.in the first approach, the equilibrium point of the system is one of the centers of the related membership fu...

The quadratic shortest path problem (QSPP) is the problem of finding a path with prespecified start vertex s and end vertex t in a digraph such that the sum of weights of arcs and the sum of interaction costs over all pairs of arcs on the path is minimized. We first consider a variant of the QSPP known as the adjacent QSPP. It was recently proven that the adjacent QSPP on cyclic digraphs cannot...

We study the question of diagonalizability of the Hamiltonian for the FaddeevReshetikhin (FR) model in the two particle sector. Although the two particle S-matrix element for the FR model, which may be relevant for the quantization of strings on AdS5×S, has been calculated recently using field theoretic methods, we find that the Hamiltonian for the system in this sector is not diagonalizable. W...

We consider here the problem of estimating p×p scale matrix Σ a multivariate linear regression model when distribution observed belongs to large class elliptically symmetric distributions. Any estimator Σˆ is assessed through data-based loss tr(S+Σ(Σ−1Σˆ−Ip)2) where S sample covariance and S+ its Moore–Penrose inverse.

The component matrix, Laplacian Distance Peripheral distance of the cyclotomic graphs and some properties are found. D-energy, $D_{p}$-energy, $D^{L}$-energy indices determined. For real symmetric matrices, matrices that attain maximum $L, L_{s}$ minimum S calculated. Hausdorff optimal matching evaluated.

Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with ...

Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with ...

The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...