Results 51 to 60 of about 134,349 (198)
Controllability of Brain Neural Networks in Learning Disorders—A Geometric Approach
The human brain can be interpreted mathematically as a linear dynamical system that shifts through various cognitive regions promoting more or less complicated behaviors. The dynamics of brain neural network play a considerable role in cognitive function
Maria Isabel García-Planas +1 more
doaj +1 more source
On eigenvalues and main eigenvalues of a graph [PDF]
Given the eigenvalues of a graph \(G\) on \(n\) vertices, for the \(i\)th eigenvalue of (a) the complement \(\overline G\) of \(G\), (b) the Seidel matrix of \(G\), and (c) a graph switching equivalent to \(G\), an interval containing this eigenvalue is determined. In addition, it is proved that the sum of all main eigenvalues of \(G\) (\(k\) in number)
openaire +2 more sources
On graphs with just three distinct eigenvalues [PDF]
Let G be a connected non-bipartite graph with exactly three distinct eigenvalues Rho, mu, lambda, where Rho >mu >lambda. In the case that G has just one non-main eigenvalue, we find necessary and sufficient spectral conditions on a vertex-deleted ...
Rowlinson, Peter
core +1 more source
The Subdominant Eigenvalue of Möbius Monotone Transition Probability Matrix
We establish a Perron–Frobenius-type theorem for the subdominant eigenvalue of Möbius monotone transition matrices defined on partially ordered state spaces.
Pei-Sen Li, Pan Zhao
doaj +1 more source
Let \(\lambda\) be an eigenvalue of a complex n by n matrix. Denote by m, \(m^*\) the multiplicity of \(\lambda\) as a root of the characteristic and minimal polynomial of the given matrix, respectively. Furthermore denote by \(\hat m\) the geometric multiplicity of \(\lambda\), i.e. the dimension of the corresponding eigenspace of \({\mathbb{C}}^ n\).
openaire +2 more sources
Bifurcations and dynamical evolution of eigenvalues of Hamiltonian systems [PDF]
The transient behavior of the eigenvalues of a state transition matrix in a Hamiltonian system is investigated. Mathematical tools are developed to derive the necessary and sufficient conditions for bifurcations of eigenvalues off and onto the unit ...
Hsiao, Fu-Yuen; Scheeres, D. J. +1 more
core +1 more source
Partial sum of eigenvalues of random graphs [PDF]
summary:Let $G$ be a graph on $n$ vertices and let $\lambda _{1}\geq \lambda _{2}\geq \ldots \geq \lambda _{n}$ be the eigenvalues of its adjacency matrix.
Rocha, Israel
core +1 more source
Randi'c incidence energy of graphs [PDF]
Let $G$ be a simple graph with vertex set $V(G) = {v_1, v_2,ldots , v_n}$ and edge set $E(G) = {e_1, e_2,ldots , e_m}$. Similar to the Randi'c matrix, here we introduce the Randi'c incidence matrix of a graph $G$, denoted by $I_R(G)$, which is defined
Ran Gu, Fei Huang, Xueliang Li
doaj
A recursive condition for the symmetric nonnegative inverse eigenvalue problem
In this paper we present a sufficient ondition and a necessary condition for Symmetri Nonnegative Inverse Eigenvalue Problem. This condition is independent of the existing realizability criteria.
Elvis Ronald Valero +2 more
doaj +1 more source
Bounded Eigenvalues of Fully Clamped and Completely Free Rectangular Plates [PDF]
Exact solution to the vibration of rectangular plates is available only for plates with two opposite edges subject to simply supported conditions. Otherwise, they are analysed by using approximate methods. There are several approximate methods to conduct
Mochida, Yusuke
core

